./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:40:49,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:40:49,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:40:49,570 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:40:49,570 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:40:49,597 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:40:49,598 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:40:49,599 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:40:49,599 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:40:49,599 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:40:49,599 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:40:49,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:40:49,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:40:49,601 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:40:49,601 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:40:49,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:40:49,601 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:40:49,601 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:40:49,601 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:40:49,601 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:40:49,602 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:40:49,602 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:40:49,602 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:40:49,602 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:40:49,602 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:40:49,602 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:40:49,603 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:40:49,603 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:40:49,603 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:40:49,603 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:40:49,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:40:49,603 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:40:49,604 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:40:49,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:40:49,604 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:40:49,604 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:40:49,604 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:40:49,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:40:49,604 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:40:49,604 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:40:49,605 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:40:49,605 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:40:49,605 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 [2025-02-08 06:40:49,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:40:49,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:40:49,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:40:49,878 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:40:49,878 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:40:49,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2025-02-08 06:40:51,158 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/043695f55/4f6c16ebd54d4aeabc9fbc6a83853133/FLAG38943bee3 [2025-02-08 06:40:51,547 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:40:51,547 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2025-02-08 06:40:51,565 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/043695f55/4f6c16ebd54d4aeabc9fbc6a83853133/FLAG38943bee3 [2025-02-08 06:40:51,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/043695f55/4f6c16ebd54d4aeabc9fbc6a83853133 [2025-02-08 06:40:51,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:40:51,748 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:40:51,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:40:51,750 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:40:51,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:40:51,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:40:51" (1/1) ... [2025-02-08 06:40:51,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bda5bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:51, skipping insertion in model container [2025-02-08 06:40:51,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:40:51" (1/1) ... [2025-02-08 06:40:51,778 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:40:52,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:40:52,080 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:40:52,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:40:52,165 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:40:52,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:52 WrapperNode [2025-02-08 06:40:52,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:40:52,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:40:52,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:40:52,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:40:52,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:52" (1/1) ... [2025-02-08 06:40:52,188 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:52" (1/1) ... [2025-02-08 06:40:52,211 INFO L138 Inliner]: procedures = 126, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 108 [2025-02-08 06:40:52,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:40:52,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:40:52,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:40:52,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:40:52,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:52" (1/1) ... [2025-02-08 06:40:52,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:52" (1/1) ... [2025-02-08 06:40:52,230 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:52" (1/1) ... [2025-02-08 06:40:52,252 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 8, 11]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 10 writes are split as follows [0, 1, 9]. [2025-02-08 06:40:52,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:52" (1/1) ... [2025-02-08 06:40:52,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:52" (1/1) ... [2025-02-08 06:40:52,263 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:52" (1/1) ... [2025-02-08 06:40:52,268 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:52" (1/1) ... [2025-02-08 06:40:52,270 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:52" (1/1) ... [2025-02-08 06:40:52,274 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:52" (1/1) ... [2025-02-08 06:40:52,276 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:40:52,277 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:40:52,277 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:40:52,277 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:40:52,282 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:52" (1/1) ... [2025-02-08 06:40:52,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:40:52,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:40:52,309 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) [2025-02-08 06:40:52,313 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 [2025-02-08 06:40:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:40:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:40:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 06:40:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-02-08 06:40:52,331 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-02-08 06:40:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:40:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:40:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:40:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:40:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:40:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 06:40:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:40:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:40:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 06:40:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:40:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 06:40:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 06:40:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 06:40:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:40:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:40:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 06:40:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:40:52,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:40:52,460 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:40:52,462 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:40:52,800 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume false; [2025-02-08 06:40:52,801 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume !false; [2025-02-08 06:40:52,801 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume false; [2025-02-08 06:40:52,801 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume !false; [2025-02-08 06:40:52,801 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L616: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-02-08 06:40:52,801 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L625: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false;main_#res#1 := 1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-02-08 06:40:52,801 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L625-1: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 06:40:52,827 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L578: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-02-08 06:40:52,846 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-02-08 06:40:52,846 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:40:52,859 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:40:52,861 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:40:52,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:40:52 BoogieIcfgContainer [2025-02-08 06:40:52,861 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:40:52,864 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:40:52,864 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:40:52,868 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:40:52,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:40:51" (1/3) ... [2025-02-08 06:40:52,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@543411e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:40:52, skipping insertion in model container [2025-02-08 06:40:52,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:52" (2/3) ... [2025-02-08 06:40:52,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@543411e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:40:52, skipping insertion in model container [2025-02-08 06:40:52,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:40:52" (3/3) ... [2025-02-08 06:40:52,872 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse.i [2025-02-08 06:40:52,890 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:40:52,892 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_remove_all_reverse.i that has 2 procedures, 94 locations, 1 initial locations, 2 loop locations, and 44 error locations. [2025-02-08 06:40:52,924 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:40:52,934 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=None, 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;@44439167, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:40:52,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-02-08 06:40:52,938 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 45 states have (on average 2.088888888888889) internal successors, (94), 90 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:40:52,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:40:52,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:52,943 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:40:52,943 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:40:52,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:52,949 INFO L85 PathProgramCache]: Analyzing trace with hash 117036882, now seen corresponding path program 1 times [2025-02-08 06:40:52,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:52,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587896075] [2025-02-08 06:40:52,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:52,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:53,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:40:53,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:40:53,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:53,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:53,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:40:53,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:53,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587896075] [2025-02-08 06:40:53,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587896075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:53,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:53,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:40:53,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013273902] [2025-02-08 06:40:53,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:53,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:40:53,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:53,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:40:53,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:40:53,196 INFO L87 Difference]: Start difference. First operand has 94 states, 45 states have (on average 2.088888888888889) internal successors, (94), 90 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:40:53,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:53,321 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2025-02-08 06:40:53,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:40:53,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 06:40:53,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:53,330 INFO L225 Difference]: With dead ends: 91 [2025-02-08 06:40:53,331 INFO L226 Difference]: Without dead ends: 87 [2025-02-08 06:40:53,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:40:53,337 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:53,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 133 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:40:53,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-08 06:40:53,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-08 06:40:53,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 83 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:40:53,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2025-02-08 06:40:53,395 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 5 [2025-02-08 06:40:53,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:53,396 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2025-02-08 06:40:53,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:40:53,396 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2025-02-08 06:40:53,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:40:53,396 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:53,396 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:40:53,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:40:53,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:40:53,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:53,398 INFO L85 PathProgramCache]: Analyzing trace with hash 117036883, now seen corresponding path program 1 times [2025-02-08 06:40:53,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:53,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953377780] [2025-02-08 06:40:53,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:53,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:53,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:40:53,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:40:53,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:53,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:53,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:40:53,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:53,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953377780] [2025-02-08 06:40:53,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953377780] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:53,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:53,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:40:53,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051951214] [2025-02-08 06:40:53,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:53,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:40:53,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:53,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:40:53,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:40:53,501 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:40:53,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:53,582 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2025-02-08 06:40:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:40:53,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 06:40:53,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:53,583 INFO L225 Difference]: With dead ends: 84 [2025-02-08 06:40:53,584 INFO L226 Difference]: Without dead ends: 84 [2025-02-08 06:40:53,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:40:53,584 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:53,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 134 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:40:53,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-08 06:40:53,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-02-08 06:40:53,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 80 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:40:53,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2025-02-08 06:40:53,596 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 5 [2025-02-08 06:40:53,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:53,596 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2025-02-08 06:40:53,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:40:53,597 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2025-02-08 06:40:53,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 06:40:53,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:53,597 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:53,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:40:53,598 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:40:53,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:53,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1830381560, now seen corresponding path program 1 times [2025-02-08 06:40:53,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:53,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218314895] [2025-02-08 06:40:53,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:53,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:53,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:40:53,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:40:53,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:53,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:53,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:40:53,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:53,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218314895] [2025-02-08 06:40:53,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218314895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:53,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:53,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:40:53,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565979958] [2025-02-08 06:40:53,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:53,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:40:53,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:53,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:40:53,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:40:53,729 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:40:53,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:53,745 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2025-02-08 06:40:53,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:40:53,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-02-08 06:40:53,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:53,747 INFO L225 Difference]: With dead ends: 95 [2025-02-08 06:40:53,747 INFO L226 Difference]: Without dead ends: 95 [2025-02-08 06:40:53,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:40:53,748 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 10 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 167 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 [2025-02-08 06:40:53,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 167 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:40:53,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-08 06:40:53,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2025-02-08 06:40:53,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 81 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:40:53,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2025-02-08 06:40:53,761 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 13 [2025-02-08 06:40:53,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:53,761 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2025-02-08 06:40:53,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:40:53,762 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2025-02-08 06:40:53,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:40:53,762 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:53,762 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:53,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:40:53,763 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:40:53,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:53,765 INFO L85 PathProgramCache]: Analyzing trace with hash 569399959, now seen corresponding path program 1 times [2025-02-08 06:40:53,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:53,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359035432] [2025-02-08 06:40:53,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:53,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:53,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:40:53,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:40:53,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:53,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:53,963 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 06:40:53,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:53,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359035432] [2025-02-08 06:40:53,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359035432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:53,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:53,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:40:53,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62423558] [2025-02-08 06:40:53,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:53,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:40:53,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:53,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:40:53,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:40:53,965 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:40:54,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:54,130 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2025-02-08 06:40:54,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:40:54,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-02-08 06:40:54,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:54,131 INFO L225 Difference]: With dead ends: 84 [2025-02-08 06:40:54,131 INFO L226 Difference]: Without dead ends: 84 [2025-02-08 06:40:54,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:40:54,132 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 7 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:54,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 230 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:40:54,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-08 06:40:54,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-02-08 06:40:54,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 80 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:40:54,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2025-02-08 06:40:54,142 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 23 [2025-02-08 06:40:54,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:54,142 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2025-02-08 06:40:54,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:40:54,143 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2025-02-08 06:40:54,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:40:54,143 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:54,143 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:54,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:40:54,144 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:40:54,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:54,146 INFO L85 PathProgramCache]: Analyzing trace with hash 569399960, now seen corresponding path program 1 times [2025-02-08 06:40:54,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:54,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478826568] [2025-02-08 06:40:54,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:54,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:54,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:40:54,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:40:54,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:54,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:54,427 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:40:54,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:54,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478826568] [2025-02-08 06:40:54,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478826568] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:54,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:54,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:40:54,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922547092] [2025-02-08 06:40:54,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:54,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:40:54,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:54,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:40:54,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:40:54,429 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:40:54,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:54,561 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2025-02-08 06:40:54,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:40:54,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-02-08 06:40:54,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:54,563 INFO L225 Difference]: With dead ends: 83 [2025-02-08 06:40:54,563 INFO L226 Difference]: Without dead ends: 83 [2025-02-08 06:40:54,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:40:54,563 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 9 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:54,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 283 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:40:54,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-08 06:40:54,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-02-08 06:40:54,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 79 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:40:54,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2025-02-08 06:40:54,571 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 23 [2025-02-08 06:40:54,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:54,571 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2025-02-08 06:40:54,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:40:54,571 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2025-02-08 06:40:54,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 06:40:54,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:54,572 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:54,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:40:54,572 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:40:54,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:54,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1732515637, now seen corresponding path program 1 times [2025-02-08 06:40:54,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:54,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289597015] [2025-02-08 06:40:54,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:54,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:54,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:40:54,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:40:54,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:54,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:40:55,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:55,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289597015] [2025-02-08 06:40:55,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289597015] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:40:55,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361386262] [2025-02-08 06:40:55,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:55,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:40:55,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:40:55,072 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) [2025-02-08 06:40:55,075 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 [2025-02-08 06:40:55,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:40:55,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:40:55,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:55,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:55,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-08 06:40:55,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:40:55,248 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 1 [2025-02-08 06:40:55,255 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 [2025-02-08 06:40:55,467 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:40:55,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-08 06:40:55,497 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:40:55,498 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 [2025-02-08 06:40:55,534 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:40:55,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:40:55,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361386262] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:40:55,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:40:55,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2025-02-08 06:40:55,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144663707] [2025-02-08 06:40:55,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:40:55,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 06:40:55,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:55,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 06:40:55,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-02-08 06:40:55,720 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:40:56,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:56,035 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2025-02-08 06:40:56,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 06:40:56,036 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2025-02-08 06:40:56,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:56,037 INFO L225 Difference]: With dead ends: 88 [2025-02-08 06:40:56,037 INFO L226 Difference]: Without dead ends: 88 [2025-02-08 06:40:56,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-02-08 06:40:56,038 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:56,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 264 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:40:56,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-08 06:40:56,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-02-08 06:40:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 49 states have (on average 1.816326530612245) internal successors, (89), 83 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:40:56,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2025-02-08 06:40:56,048 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 25 [2025-02-08 06:40:56,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:56,049 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2025-02-08 06:40:56,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:40:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2025-02-08 06:40:56,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 06:40:56,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:56,050 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:56,060 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 [2025-02-08 06:40:56,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:40:56,256 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:40:56,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:56,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1732515636, now seen corresponding path program 1 times [2025-02-08 06:40:56,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:56,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123800638] [2025-02-08 06:40:56,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:56,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:56,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:40:56,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:40:56,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:56,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:56,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:40:56,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:56,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123800638] [2025-02-08 06:40:56,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123800638] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:40:56,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894518687] [2025-02-08 06:40:56,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:56,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:40:56,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:40:56,524 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) [2025-02-08 06:40:56,526 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 [2025-02-08 06:40:56,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:40:56,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:40:56,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:56,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:56,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 06:40:56,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:40:56,644 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 [2025-02-08 06:40:56,672 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2025-02-08 06:40:56,708 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 06:40:56,709 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 [2025-02-08 06:40:56,730 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-02-08 06:40:56,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:40:56,898 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:40:56,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894518687] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:40:56,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:40:56,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 11 [2025-02-08 06:40:56,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223181270] [2025-02-08 06:40:56,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:40:56,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 06:40:56,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:56,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 06:40:56,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2025-02-08 06:40:56,900 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:40:57,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:57,195 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2025-02-08 06:40:57,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:40:57,199 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2025-02-08 06:40:57,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:57,200 INFO L225 Difference]: With dead ends: 88 [2025-02-08 06:40:57,200 INFO L226 Difference]: Without dead ends: 88 [2025-02-08 06:40:57,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=101, Unknown=1, NotChecked=20, Total=156 [2025-02-08 06:40:57,202 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 1 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:57,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 359 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 380 Invalid, 0 Unknown, 87 Unchecked, 0.3s Time] [2025-02-08 06:40:57,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-08 06:40:57,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-02-08 06:40:57,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:40:57,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2025-02-08 06:40:57,213 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 25 [2025-02-08 06:40:57,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:57,213 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2025-02-08 06:40:57,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:40:57,213 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2025-02-08 06:40:57,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 06:40:57,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:57,216 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:57,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 06:40:57,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:40:57,420 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:40:57,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:57,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1499753949, now seen corresponding path program 1 times [2025-02-08 06:40:57,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:57,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701048113] [2025-02-08 06:40:57,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:57,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:57,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 06:40:57,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 06:40:57,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:57,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:40:57,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:57,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701048113] [2025-02-08 06:40:57,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701048113] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:40:57,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270701413] [2025-02-08 06:40:57,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:57,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:40:57,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:40:57,520 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) [2025-02-08 06:40:57,523 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 [2025-02-08 06:40:57,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 06:40:57,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 06:40:57,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:57,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:57,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 06:40:57,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:40:57,658 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:40:57,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:40:57,690 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:40:57,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270701413] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:40:57,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:40:57,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-02-08 06:40:57,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510481483] [2025-02-08 06:40:57,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:40:57,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:40:57,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:57,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:40:57,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:40:57,692 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:40:57,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:57,740 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2025-02-08 06:40:57,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:40:57,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-02-08 06:40:57,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:57,742 INFO L225 Difference]: With dead ends: 88 [2025-02-08 06:40:57,742 INFO L226 Difference]: Without dead ends: 88 [2025-02-08 06:40:57,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:40:57,743 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:57,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 370 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:40:57,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-08 06:40:57,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-02-08 06:40:57,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 83 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:40:57,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2025-02-08 06:40:57,747 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 27 [2025-02-08 06:40:57,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:57,748 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2025-02-08 06:40:57,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:40:57,748 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2025-02-08 06:40:57,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 06:40:57,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:57,749 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:57,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 06:40:57,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:40:57,950 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:40:57,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:57,950 INFO L85 PathProgramCache]: Analyzing trace with hash 751363084, now seen corresponding path program 1 times [2025-02-08 06:40:57,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:57,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165474545] [2025-02-08 06:40:57,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:57,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:57,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 06:40:57,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:40:57,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:57,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 06:40:58,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:58,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165474545] [2025-02-08 06:40:58,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165474545] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:40:58,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977675333] [2025-02-08 06:40:58,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:58,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:40:58,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:40:58,072 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) [2025-02-08 06:40:58,073 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 [2025-02-08 06:40:58,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 06:40:58,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:40:58,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:58,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:58,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 06:40:58,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:40:58,202 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 [2025-02-08 06:40:58,260 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-02-08 06:40:58,317 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 06:40:58,319 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 [2025-02-08 06:40:58,331 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2025-02-08 06:40:58,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:40:58,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977675333] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:40:58,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:40:58,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2025-02-08 06:40:58,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399364770] [2025-02-08 06:40:58,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:40:58,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:40:58,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:58,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:40:58,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2025-02-08 06:40:58,390 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:40:58,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:58,644 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2025-02-08 06:40:58,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:40:58,644 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2025-02-08 06:40:58,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:58,645 INFO L225 Difference]: With dead ends: 87 [2025-02-08 06:40:58,645 INFO L226 Difference]: Without dead ends: 87 [2025-02-08 06:40:58,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2025-02-08 06:40:58,646 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 9 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:58,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 344 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 309 Invalid, 0 Unknown, 85 Unchecked, 0.2s Time] [2025-02-08 06:40:58,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-08 06:40:58,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-08 06:40:58,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 49 states have (on average 1.7551020408163265) internal successors, (86), 82 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:40:58,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2025-02-08 06:40:58,650 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 28 [2025-02-08 06:40:58,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:58,650 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2025-02-08 06:40:58,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:40:58,650 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2025-02-08 06:40:58,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 06:40:58,651 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:58,651 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:58,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 06:40:58,851 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,SelfDestructingSolverStorable8 [2025-02-08 06:40:58,852 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:40:58,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:58,852 INFO L85 PathProgramCache]: Analyzing trace with hash 751363085, now seen corresponding path program 1 times [2025-02-08 06:40:58,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:58,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174776181] [2025-02-08 06:40:58,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:58,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:58,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 06:40:58,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:40:58,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:58,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:59,031 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:40:59,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:59,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174776181] [2025-02-08 06:40:59,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174776181] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:40:59,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910066548] [2025-02-08 06:40:59,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:59,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:40:59,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:40:59,034 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) [2025-02-08 06:40:59,037 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 [2025-02-08 06:40:59,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 06:40:59,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:40:59,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:59,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:59,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 06:40:59,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:40:59,165 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 1 [2025-02-08 06:40:59,171 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 [2025-02-08 06:40:59,302 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-02-08 06:40:59,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:40:59,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:40:59,345 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:40:59,345 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 [2025-02-08 06:40:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-02-08 06:40:59,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:40:59,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910066548] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:40:59,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:40:59,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2025-02-08 06:40:59,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816740892] [2025-02-08 06:40:59,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:40:59,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 06:40:59,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:59,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 06:40:59,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2025-02-08 06:40:59,493 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:40:59,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:59,781 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2025-02-08 06:40:59,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:40:59,781 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2025-02-08 06:40:59,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:59,783 INFO L225 Difference]: With dead ends: 104 [2025-02-08 06:40:59,783 INFO L226 Difference]: Without dead ends: 104 [2025-02-08 06:40:59,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=316, Unknown=1, NotChecked=36, Total=420 [2025-02-08 06:40:59,784 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 16 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:59,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 453 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 305 Invalid, 0 Unknown, 107 Unchecked, 0.2s Time] [2025-02-08 06:40:59,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-08 06:40:59,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 97. [2025-02-08 06:40:59,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 58 states have (on average 1.7241379310344827) internal successors, (100), 91 states have internal predecessors, (100), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:40:59,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2025-02-08 06:40:59,789 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 28 [2025-02-08 06:40:59,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:59,790 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2025-02-08 06:40:59,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:40:59,790 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2025-02-08 06:40:59,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 06:40:59,790 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:59,791 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:59,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 06:40:59,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 06:40:59,995 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:40:59,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:59,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1817419165, now seen corresponding path program 1 times [2025-02-08 06:40:59,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:59,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439469028] [2025-02-08 06:40:59,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:59,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:00,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 06:41:00,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 06:41:00,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:00,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:00,115 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 06:41:00,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:00,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439469028] [2025-02-08 06:41:00,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439469028] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:00,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:00,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:41:00,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625090576] [2025-02-08 06:41:00,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:00,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:41:00,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:00,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:41:00,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:41:00,119 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:00,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:00,269 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2025-02-08 06:41:00,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:41:00,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-02-08 06:41:00,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:00,270 INFO L225 Difference]: With dead ends: 96 [2025-02-08 06:41:00,270 INFO L226 Difference]: Without dead ends: 96 [2025-02-08 06:41:00,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:41:00,271 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 7 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:00,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 257 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:41:00,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-08 06:41:00,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-08 06:41:00,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 58 states have (on average 1.706896551724138) internal successors, (99), 90 states have internal predecessors, (99), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:41:00,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2025-02-08 06:41:00,279 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 29 [2025-02-08 06:41:00,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:00,279 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2025-02-08 06:41:00,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:00,279 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2025-02-08 06:41:00,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 06:41:00,282 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:00,282 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:00,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 06:41:00,282 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:41:00,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:00,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1817419166, now seen corresponding path program 1 times [2025-02-08 06:41:00,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:00,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019259669] [2025-02-08 06:41:00,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:00,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:00,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 06:41:00,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 06:41:00,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:00,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:00,479 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:41:00,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:00,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019259669] [2025-02-08 06:41:00,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019259669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:00,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:00,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:41:00,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146756091] [2025-02-08 06:41:00,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:00,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:41:00,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:00,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:41:00,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:41:00,482 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:00,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:00,628 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2025-02-08 06:41:00,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:41:00,628 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-02-08 06:41:00,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:00,629 INFO L225 Difference]: With dead ends: 95 [2025-02-08 06:41:00,630 INFO L226 Difference]: Without dead ends: 95 [2025-02-08 06:41:00,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:41:00,630 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 6 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:00,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 282 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:41:00,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-08 06:41:00,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-02-08 06:41:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 58 states have (on average 1.6896551724137931) internal successors, (98), 89 states have internal predecessors, (98), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:41:00,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2025-02-08 06:41:00,637 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 29 [2025-02-08 06:41:00,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:00,638 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2025-02-08 06:41:00,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:00,638 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2025-02-08 06:41:00,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-08 06:41:00,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:00,638 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:00,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 06:41:00,638 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:41:00,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:00,639 INFO L85 PathProgramCache]: Analyzing trace with hash 376650792, now seen corresponding path program 1 times [2025-02-08 06:41:00,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:00,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41854394] [2025-02-08 06:41:00,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:00,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:00,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 06:41:00,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 06:41:00,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:00,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:00,958 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:41:00,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:00,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41854394] [2025-02-08 06:41:00,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41854394] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:00,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517104849] [2025-02-08 06:41:00,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:00,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:00,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:00,961 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:41:00,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 06:41:01,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 06:41:01,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 06:41:01,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:01,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:01,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 06:41:01,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:01,115 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 [2025-02-08 06:41:01,133 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 [2025-02-08 06:41:01,143 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-02-08 06:41:01,193 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 06:41:01,194 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 [2025-02-08 06:41:01,215 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 [2025-02-08 06:41:01,226 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2025-02-08 06:41:01,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:01,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:41:01,292 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2025-02-08 06:41:01,292 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:01,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517104849] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:01,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:41:01,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 13 [2025-02-08 06:41:01,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86370009] [2025-02-08 06:41:01,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:01,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 06:41:01,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:01,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 06:41:01,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=142, Unknown=2, NotChecked=50, Total=240 [2025-02-08 06:41:01,357 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 12 states have internal predecessors, (53), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:41:01,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:01,687 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2025-02-08 06:41:01,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 06:41:01,687 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 12 states have internal predecessors, (53), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2025-02-08 06:41:01,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:01,688 INFO L225 Difference]: With dead ends: 122 [2025-02-08 06:41:01,688 INFO L226 Difference]: Without dead ends: 122 [2025-02-08 06:41:01,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=214, Unknown=2, NotChecked=62, Total=342 [2025-02-08 06:41:01,689 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 157 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:01,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 208 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 332 Invalid, 0 Unknown, 212 Unchecked, 0.3s Time] [2025-02-08 06:41:01,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-08 06:41:01,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 95. [2025-02-08 06:41:01,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 89 states have internal predecessors, (101), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:41:01,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2025-02-08 06:41:01,693 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 32 [2025-02-08 06:41:01,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:01,693 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2025-02-08 06:41:01,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 12 states have internal predecessors, (53), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:41:01,693 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2025-02-08 06:41:01,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-08 06:41:01,694 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:01,694 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:01,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 06:41:01,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-08 06:41:01,898 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:41:01,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:01,898 INFO L85 PathProgramCache]: Analyzing trace with hash 376650793, now seen corresponding path program 1 times [2025-02-08 06:41:01,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:01,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223214604] [2025-02-08 06:41:01,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:01,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:01,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 06:41:01,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 06:41:01,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:01,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:02,287 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:02,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:02,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223214604] [2025-02-08 06:41:02,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223214604] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:02,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014926461] [2025-02-08 06:41:02,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:02,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:02,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:02,290 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:41:02,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 06:41:02,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 06:41:02,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 06:41:02,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:02,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:02,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-08 06:41:02,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:02,450 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 1 [2025-02-08 06:41:02,463 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 [2025-02-08 06:41:02,472 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2025-02-08 06:41:02,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:02,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:41:02,540 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 [2025-02-08 06:41:02,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:02,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:41:02,628 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 06:41:02,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:02,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014926461] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:02,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:41:02,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 11 [2025-02-08 06:41:02,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715765225] [2025-02-08 06:41:02,756 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:02,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 06:41:02,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:02,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 06:41:02,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=167, Unknown=1, NotChecked=26, Total=240 [2025-02-08 06:41:02,758 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:41:03,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:03,058 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2025-02-08 06:41:03,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:41:03,059 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2025-02-08 06:41:03,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:03,060 INFO L225 Difference]: With dead ends: 88 [2025-02-08 06:41:03,060 INFO L226 Difference]: Without dead ends: 88 [2025-02-08 06:41:03,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=242, Unknown=1, NotChecked=32, Total=342 [2025-02-08 06:41:03,061 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 131 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:03,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 213 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 329 Invalid, 0 Unknown, 66 Unchecked, 0.2s Time] [2025-02-08 06:41:03,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-08 06:41:03,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-02-08 06:41:03,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 82 states have internal predecessors, (92), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:41:03,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2025-02-08 06:41:03,065 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 32 [2025-02-08 06:41:03,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:03,065 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2025-02-08 06:41:03,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:41:03,066 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2025-02-08 06:41:03,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 06:41:03,067 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:03,067 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:03,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 06:41:03,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:03,268 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:41:03,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:03,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1208727303, now seen corresponding path program 1 times [2025-02-08 06:41:03,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:03,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934946083] [2025-02-08 06:41:03,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:03,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:03,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 06:41:03,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 06:41:03,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:03,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:03,594 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:41:03,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:03,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934946083] [2025-02-08 06:41:03,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934946083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:03,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:03,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 06:41:03,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998762861] [2025-02-08 06:41:03,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:03,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:41:03,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:03,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:41:03,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:41:03,596 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:03,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:03,852 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2025-02-08 06:41:03,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:41:03,853 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-02-08 06:41:03,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:03,853 INFO L225 Difference]: With dead ends: 128 [2025-02-08 06:41:03,853 INFO L226 Difference]: Without dead ends: 128 [2025-02-08 06:41:03,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:41:03,854 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 74 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:03,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 334 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:41:03,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-02-08 06:41:03,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 106. [2025-02-08 06:41:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 79 states have (on average 1.5696202531645569) internal successors, (124), 100 states have internal predecessors, (124), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:41:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 132 transitions. [2025-02-08 06:41:03,858 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 132 transitions. Word has length 33 [2025-02-08 06:41:03,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:03,858 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 132 transitions. [2025-02-08 06:41:03,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:03,858 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 132 transitions. [2025-02-08 06:41:03,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 06:41:03,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:03,859 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:03,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 06:41:03,859 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:41:03,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:03,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1208727304, now seen corresponding path program 1 times [2025-02-08 06:41:03,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:03,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197077558] [2025-02-08 06:41:03,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:03,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:03,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 06:41:03,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 06:41:03,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:03,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:03,971 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:41:03,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:03,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197077558] [2025-02-08 06:41:03,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197077558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:03,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:03,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:41:03,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526562549] [2025-02-08 06:41:03,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:03,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:41:03,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:03,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:41:03,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:41:03,973 INFO L87 Difference]: Start difference. First operand 106 states and 132 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:04,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:04,101 INFO L93 Difference]: Finished difference Result 127 states and 154 transitions. [2025-02-08 06:41:04,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:41:04,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-02-08 06:41:04,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:04,102 INFO L225 Difference]: With dead ends: 127 [2025-02-08 06:41:04,102 INFO L226 Difference]: Without dead ends: 127 [2025-02-08 06:41:04,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:41:04,103 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 44 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:04,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 195 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:41:04,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-08 06:41:04,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 107. [2025-02-08 06:41:04,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 80 states have (on average 1.5625) internal successors, (125), 101 states have internal predecessors, (125), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:41:04,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 133 transitions. [2025-02-08 06:41:04,108 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 133 transitions. Word has length 33 [2025-02-08 06:41:04,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:04,109 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 133 transitions. [2025-02-08 06:41:04,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:04,109 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 133 transitions. [2025-02-08 06:41:04,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-08 06:41:04,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:04,109 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:04,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 06:41:04,111 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:41:04,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:04,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1184140455, now seen corresponding path program 1 times [2025-02-08 06:41:04,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:04,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679577567] [2025-02-08 06:41:04,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:04,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:04,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 06:41:04,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 06:41:04,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:04,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:41:04,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:04,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679577567] [2025-02-08 06:41:04,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679577567] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:04,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:04,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:41:04,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750685367] [2025-02-08 06:41:04,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:04,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:41:04,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:04,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:41:04,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:41:04,208 INFO L87 Difference]: Start difference. First operand 107 states and 133 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:04,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:04,225 INFO L93 Difference]: Finished difference Result 141 states and 167 transitions. [2025-02-08 06:41:04,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:41:04,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2025-02-08 06:41:04,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:04,226 INFO L225 Difference]: With dead ends: 141 [2025-02-08 06:41:04,226 INFO L226 Difference]: Without dead ends: 141 [2025-02-08 06:41:04,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:41:04,227 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 83 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:04,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 149 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:41:04,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-02-08 06:41:04,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 106. [2025-02-08 06:41:04,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 79 states have (on average 1.5569620253164558) internal successors, (123), 100 states have internal predecessors, (123), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:41:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 131 transitions. [2025-02-08 06:41:04,232 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 131 transitions. Word has length 34 [2025-02-08 06:41:04,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:04,233 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 131 transitions. [2025-02-08 06:41:04,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:04,233 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2025-02-08 06:41:04,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-08 06:41:04,233 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:04,233 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:04,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 06:41:04,234 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:41:04,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:04,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1572499214, now seen corresponding path program 1 times [2025-02-08 06:41:04,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:04,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994795384] [2025-02-08 06:41:04,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:04,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:04,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 06:41:04,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 06:41:04,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:04,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:04,739 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:41:04,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:04,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994795384] [2025-02-08 06:41:04,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994795384] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:04,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:04,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 06:41:04,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64549042] [2025-02-08 06:41:04,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:04,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 06:41:04,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:04,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 06:41:04,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-02-08 06:41:04,740 INFO L87 Difference]: Start difference. First operand 106 states and 131 transitions. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:05,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:05,095 INFO L93 Difference]: Finished difference Result 123 states and 148 transitions. [2025-02-08 06:41:05,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 06:41:05,096 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2025-02-08 06:41:05,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:05,096 INFO L225 Difference]: With dead ends: 123 [2025-02-08 06:41:05,096 INFO L226 Difference]: Without dead ends: 123 [2025-02-08 06:41:05,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-02-08 06:41:05,097 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 57 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:05,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 421 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:41:05,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-02-08 06:41:05,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2025-02-08 06:41:05,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 83 states have (on average 1.5301204819277108) internal successors, (127), 103 states have internal predecessors, (127), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:41:05,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2025-02-08 06:41:05,102 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 37 [2025-02-08 06:41:05,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:05,103 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2025-02-08 06:41:05,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:05,103 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2025-02-08 06:41:05,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-08 06:41:05,103 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:05,103 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:05,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 06:41:05,104 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:41:05,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:05,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1572499213, now seen corresponding path program 1 times [2025-02-08 06:41:05,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:05,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522861676] [2025-02-08 06:41:05,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:05,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:05,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 06:41:05,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 06:41:05,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:05,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:05,882 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 06:41:05,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:05,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522861676] [2025-02-08 06:41:05,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522861676] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:05,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950747438] [2025-02-08 06:41:05,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:05,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:05,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:05,886 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:41:05,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 06:41:06,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 06:41:06,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 06:41:06,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:06,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:06,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-02-08 06:41:06,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:06,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 06:41:06,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:41:06,596 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 44 treesize of output 32 [2025-02-08 06:41:06,602 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 36 treesize of output 24 [2025-02-08 06:41:06,647 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 21 treesize of output 9 [2025-02-08 06:41:06,683 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:41:06,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:06,870 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 64 treesize of output 48 [2025-02-08 06:41:06,873 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 52 treesize of output 36 [2025-02-08 06:41:06,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:06,959 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 21 treesize of output 25 [2025-02-08 06:41:07,133 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:41:07,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950747438] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:41:07,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:41:07,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 12] total 35 [2025-02-08 06:41:07,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440548025] [2025-02-08 06:41:07,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:07,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-08 06:41:07,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:07,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-08 06:41:07,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1162, Unknown=0, NotChecked=0, Total=1260 [2025-02-08 06:41:07,135 INFO L87 Difference]: Start difference. First operand 109 states and 135 transitions. Second operand has 36 states, 34 states have (on average 2.176470588235294) internal successors, (74), 32 states have internal predecessors, (74), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:41:08,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:08,120 INFO L93 Difference]: Finished difference Result 138 states and 165 transitions. [2025-02-08 06:41:08,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 06:41:08,121 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 2.176470588235294) internal successors, (74), 32 states have internal predecessors, (74), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2025-02-08 06:41:08,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:08,122 INFO L225 Difference]: With dead ends: 138 [2025-02-08 06:41:08,122 INFO L226 Difference]: Without dead ends: 138 [2025-02-08 06:41:08,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=192, Invalid=1970, Unknown=0, NotChecked=0, Total=2162 [2025-02-08 06:41:08,123 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 159 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:08,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 905 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 06:41:08,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-08 06:41:08,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 121. [2025-02-08 06:41:08,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 95 states have (on average 1.4736842105263157) internal successors, (140), 115 states have internal predecessors, (140), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:41:08,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2025-02-08 06:41:08,127 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 37 [2025-02-08 06:41:08,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:08,127 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2025-02-08 06:41:08,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 2.176470588235294) internal successors, (74), 32 states have internal predecessors, (74), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:41:08,128 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2025-02-08 06:41:08,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 06:41:08,128 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:08,128 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:08,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 06:41:08,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:08,329 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:41:08,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:08,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1502860181, now seen corresponding path program 1 times [2025-02-08 06:41:08,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:08,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121800679] [2025-02-08 06:41:08,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:08,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:08,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 06:41:08,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:41:08,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:08,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:08,531 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:41:08,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:08,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121800679] [2025-02-08 06:41:08,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121800679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:08,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:08,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 06:41:08,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085454644] [2025-02-08 06:41:08,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:08,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:41:08,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:08,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:41:08,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:41:08,533 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:08,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:08,694 INFO L93 Difference]: Finished difference Result 120 states and 147 transitions. [2025-02-08 06:41:08,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:41:08,695 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2025-02-08 06:41:08,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:08,695 INFO L225 Difference]: With dead ends: 120 [2025-02-08 06:41:08,695 INFO L226 Difference]: Without dead ends: 120 [2025-02-08 06:41:08,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-02-08 06:41:08,697 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 71 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:08,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 350 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:41:08,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-08 06:41:08,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-02-08 06:41:08,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 95 states have (on average 1.4631578947368422) internal successors, (139), 114 states have internal predecessors, (139), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:41:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 147 transitions. [2025-02-08 06:41:08,703 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 147 transitions. Word has length 38 [2025-02-08 06:41:08,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:08,704 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 147 transitions. [2025-02-08 06:41:08,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:08,704 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 147 transitions. [2025-02-08 06:41:08,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 06:41:08,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:08,705 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:08,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 06:41:08,705 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:41:08,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:08,705 INFO L85 PathProgramCache]: Analyzing trace with hash 836113737, now seen corresponding path program 1 times [2025-02-08 06:41:08,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:08,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558582133] [2025-02-08 06:41:08,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:08,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:08,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:41:08,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:41:08,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:08,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:08,779 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:41:08,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:08,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558582133] [2025-02-08 06:41:08,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558582133] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:08,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614914868] [2025-02-08 06:41:08,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:08,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:08,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:08,783 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:41:08,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 06:41:08,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:41:08,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:41:08,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:08,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:08,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 06:41:08,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 06:41:08,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:41:08,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614914868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:08,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:41:08,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-08 06:41:08,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858401427] [2025-02-08 06:41:08,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:08,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:41:08,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:08,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:41:08,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:41:08,986 INFO L87 Difference]: Start difference. First operand 120 states and 147 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:41:08,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:08,997 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2025-02-08 06:41:08,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:41:08,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2025-02-08 06:41:08,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:08,998 INFO L225 Difference]: With dead ends: 92 [2025-02-08 06:41:08,998 INFO L226 Difference]: Without dead ends: 92 [2025-02-08 06:41:08,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:41:08,999 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:08,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:41:09,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-08 06:41:09,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-08 06:41:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 88 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:41:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 108 transitions. [2025-02-08 06:41:09,004 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 108 transitions. Word has length 40 [2025-02-08 06:41:09,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:09,004 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 108 transitions. [2025-02-08 06:41:09,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:41:09,004 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2025-02-08 06:41:09,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 06:41:09,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:09,005 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:09,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 06:41:09,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:09,206 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:41:09,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:09,206 INFO L85 PathProgramCache]: Analyzing trace with hash 655974640, now seen corresponding path program 1 times [2025-02-08 06:41:09,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:09,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903502453] [2025-02-08 06:41:09,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:09,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:09,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 06:41:09,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 06:41:09,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:09,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:09,393 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:41:09,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:09,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903502453] [2025-02-08 06:41:09,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903502453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:09,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:09,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 06:41:09,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856223238] [2025-02-08 06:41:09,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:09,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:41:09,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:09,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:41:09,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:41:09,395 INFO L87 Difference]: Start difference. First operand 92 states and 108 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:09,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:09,594 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2025-02-08 06:41:09,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:41:09,594 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2025-02-08 06:41:09,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:09,597 INFO L225 Difference]: With dead ends: 111 [2025-02-08 06:41:09,597 INFO L226 Difference]: Without dead ends: 111 [2025-02-08 06:41:09,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:41:09,599 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 59 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:09,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 361 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:41:09,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-08 06:41:09,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2025-02-08 06:41:09,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 91 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:41:09,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2025-02-08 06:41:09,605 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 39 [2025-02-08 06:41:09,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:09,605 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2025-02-08 06:41:09,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:09,605 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2025-02-08 06:41:09,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 06:41:09,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:09,605 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:09,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 06:41:09,606 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:41:09,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:09,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1139622647, now seen corresponding path program 1 times [2025-02-08 06:41:09,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:09,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346582315] [2025-02-08 06:41:09,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:09,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:09,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:41:09,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:41:09,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:09,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:09,705 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:41:09,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:09,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346582315] [2025-02-08 06:41:09,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346582315] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:09,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:09,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:41:09,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404852644] [2025-02-08 06:41:09,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:09,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:41:09,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:09,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:41:09,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:41:09,707 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:09,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:09,783 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2025-02-08 06:41:09,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:41:09,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2025-02-08 06:41:09,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:09,784 INFO L225 Difference]: With dead ends: 94 [2025-02-08 06:41:09,784 INFO L226 Difference]: Without dead ends: 94 [2025-02-08 06:41:09,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:41:09,785 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 13 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:09,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 144 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:41:09,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-08 06:41:09,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-08 06:41:09,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 90 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:41:09,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2025-02-08 06:41:09,787 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 40 [2025-02-08 06:41:09,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:09,788 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2025-02-08 06:41:09,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:09,788 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2025-02-08 06:41:09,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 06:41:09,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:09,789 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:09,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 06:41:09,789 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:41:09,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:09,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1115764029, now seen corresponding path program 1 times [2025-02-08 06:41:09,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:09,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599738077] [2025-02-08 06:41:09,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:09,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:09,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:41:09,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:41:09,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:09,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:41:10,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:10,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599738077] [2025-02-08 06:41:10,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599738077] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:10,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406474171] [2025-02-08 06:41:10,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:10,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:10,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:10,201 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:41:10,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 06:41:10,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:41:10,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:41:10,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:10,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:10,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-08 06:41:10,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:10,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:41:10,778 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 21 treesize of output 13 [2025-02-08 06:41:10,812 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 17 treesize of output 9 [2025-02-08 06:41:10,874 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:41:10,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:11,012 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 26 treesize of output 18 [2025-02-08 06:41:11,015 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 22 treesize of output 14 [2025-02-08 06:41:11,119 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:41:11,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406474171] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:41:11,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:41:11,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 11] total 32 [2025-02-08 06:41:11,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865237468] [2025-02-08 06:41:11,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:11,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-08 06:41:11,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:11,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-08 06:41:11,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=958, Unknown=0, NotChecked=0, Total=1056 [2025-02-08 06:41:11,121 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. Second operand has 33 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 29 states have internal predecessors, (72), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 06:41:11,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:11,663 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2025-02-08 06:41:11,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 06:41:11,663 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 29 states have internal predecessors, (72), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 40 [2025-02-08 06:41:11,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:11,664 INFO L225 Difference]: With dead ends: 107 [2025-02-08 06:41:11,664 INFO L226 Difference]: Without dead ends: 107 [2025-02-08 06:41:11,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 51 SyntacticMatches, 12 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=1403, Unknown=0, NotChecked=0, Total=1560 [2025-02-08 06:41:11,665 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 129 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:11,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 656 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 06:41:11,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-08 06:41:11,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2025-02-08 06:41:11,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 91 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:41:11,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2025-02-08 06:41:11,671 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 40 [2025-02-08 06:41:11,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:11,671 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2025-02-08 06:41:11,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 29 states have internal predecessors, (72), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 06:41:11,671 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2025-02-08 06:41:11,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 06:41:11,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:11,672 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:11,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 06:41:11,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-08 06:41:11,872 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:41:11,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:11,873 INFO L85 PathProgramCache]: Analyzing trace with hash -968563699, now seen corresponding path program 1 times [2025-02-08 06:41:11,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:11,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327032771] [2025-02-08 06:41:11,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:11,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:11,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 06:41:11,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 06:41:11,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:11,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:12,085 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:41:12,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:12,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327032771] [2025-02-08 06:41:12,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327032771] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:12,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830633032] [2025-02-08 06:41:12,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:12,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:12,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:12,089 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:41:12,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 06:41:12,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 06:41:12,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 06:41:12,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:12,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:12,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 06:41:12,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:12,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:12,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:41:12,387 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:41:12,387 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:41:12,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830633032] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:12,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:41:12,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 15 [2025-02-08 06:41:12,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503446511] [2025-02-08 06:41:12,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:12,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:41:12,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:12,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:41:12,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-02-08 06:41:12,389 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:12,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:12,523 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2025-02-08 06:41:12,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:41:12,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2025-02-08 06:41:12,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:12,524 INFO L225 Difference]: With dead ends: 94 [2025-02-08 06:41:12,524 INFO L226 Difference]: Without dead ends: 94 [2025-02-08 06:41:12,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-02-08 06:41:12,524 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 76 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:12,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 112 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:41:12,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-08 06:41:12,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-08 06:41:12,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.394736842105263) internal successors, (106), 90 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:41:12,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2025-02-08 06:41:12,530 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 41 [2025-02-08 06:41:12,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:12,531 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2025-02-08 06:41:12,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:12,531 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2025-02-08 06:41:12,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-08 06:41:12,531 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:12,531 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:12,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 06:41:12,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-08 06:41:12,732 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:41:12,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:12,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1492592672, now seen corresponding path program 1 times [2025-02-08 06:41:12,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:12,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027575928] [2025-02-08 06:41:12,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:12,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:12,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 06:41:12,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 06:41:12,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:12,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:12,851 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:41:12,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:12,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027575928] [2025-02-08 06:41:12,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027575928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:12,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:12,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:41:12,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952600372] [2025-02-08 06:41:12,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:12,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:41:12,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:12,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:41:12,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:41:12,853 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:12,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:12,954 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2025-02-08 06:41:12,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:41:12,954 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2025-02-08 06:41:12,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:12,955 INFO L225 Difference]: With dead ends: 93 [2025-02-08 06:41:12,955 INFO L226 Difference]: Without dead ends: 93 [2025-02-08 06:41:12,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:41:12,956 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 78 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:12,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 104 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:41:12,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-08 06:41:12,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-02-08 06:41:12,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 76 states have (on average 1.368421052631579) internal successors, (104), 89 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:41:12,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2025-02-08 06:41:12,959 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 42 [2025-02-08 06:41:12,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:12,959 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2025-02-08 06:41:12,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:12,959 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2025-02-08 06:41:12,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 06:41:12,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:12,960 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:12,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 06:41:12,960 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:41:12,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:12,960 INFO L85 PathProgramCache]: Analyzing trace with hash -974267413, now seen corresponding path program 1 times [2025-02-08 06:41:12,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:12,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28404132] [2025-02-08 06:41:12,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:12,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:12,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 06:41:12,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 06:41:12,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:12,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:13,358 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:41:13,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:13,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28404132] [2025-02-08 06:41:13,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28404132] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:13,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:13,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-08 06:41:13,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808835926] [2025-02-08 06:41:13,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:13,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 06:41:13,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:13,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 06:41:13,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-02-08 06:41:13,359 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:13,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:13,639 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2025-02-08 06:41:13,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 06:41:13,639 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2025-02-08 06:41:13,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:13,640 INFO L225 Difference]: With dead ends: 103 [2025-02-08 06:41:13,640 INFO L226 Difference]: Without dead ends: 103 [2025-02-08 06:41:13,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-02-08 06:41:13,641 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 55 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:13,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 269 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:41:13,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-08 06:41:13,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2025-02-08 06:41:13,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 92 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:41:13,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2025-02-08 06:41:13,644 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 43 [2025-02-08 06:41:13,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:13,644 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2025-02-08 06:41:13,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:13,645 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2025-02-08 06:41:13,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 06:41:13,645 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:13,645 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:13,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 06:41:13,646 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:41:13,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:13,646 INFO L85 PathProgramCache]: Analyzing trace with hash -974267412, now seen corresponding path program 1 times [2025-02-08 06:41:13,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:13,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505271668] [2025-02-08 06:41:13,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:13,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:13,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 06:41:13,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 06:41:13,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:13,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:13,938 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:41:13,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:13,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505271668] [2025-02-08 06:41:13,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505271668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:13,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:13,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 06:41:13,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372314752] [2025-02-08 06:41:13,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:13,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 06:41:13,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:13,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 06:41:13,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:41:13,941 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:14,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:14,147 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2025-02-08 06:41:14,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:41:14,147 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2025-02-08 06:41:14,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:14,148 INFO L225 Difference]: With dead ends: 108 [2025-02-08 06:41:14,148 INFO L226 Difference]: Without dead ends: 108 [2025-02-08 06:41:14,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-02-08 06:41:14,148 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 48 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:14,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 339 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:41:14,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-08 06:41:14,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2025-02-08 06:41:14,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 92 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:41:14,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2025-02-08 06:41:14,151 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 43 [2025-02-08 06:41:14,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:14,152 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2025-02-08 06:41:14,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:14,152 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2025-02-08 06:41:14,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 06:41:14,152 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:14,152 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:14,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 06:41:14,153 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:41:14,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:14,153 INFO L85 PathProgramCache]: Analyzing trace with hash -890871739, now seen corresponding path program 1 times [2025-02-08 06:41:14,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:14,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469605228] [2025-02-08 06:41:14,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:14,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:14,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 06:41:14,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 06:41:14,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:14,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:41:14,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:14,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469605228] [2025-02-08 06:41:14,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469605228] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:14,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475748165] [2025-02-08 06:41:14,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:14,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:14,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:14,231 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:41:14,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 06:41:14,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 06:41:14,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 06:41:14,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:14,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:14,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 06:41:14,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:14,451 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 [2025-02-08 06:41:14,464 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 [2025-02-08 06:41:14,474 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2025-02-08 06:41:14,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:14,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:41:14,516 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 [2025-02-08 06:41:14,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:14,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:41:14,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:14,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:41:14,634 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:41:14,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:14,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475748165] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:14,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:41:14,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 8 [2025-02-08 06:41:14,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932372361] [2025-02-08 06:41:14,844 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:14,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:41:14,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:14,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:41:14,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=68, Unknown=1, NotChecked=16, Total=110 [2025-02-08 06:41:14,845 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:41:14,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:14,957 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2025-02-08 06:41:14,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:41:14,957 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2025-02-08 06:41:14,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:14,958 INFO L225 Difference]: With dead ends: 123 [2025-02-08 06:41:14,958 INFO L226 Difference]: Without dead ends: 123 [2025-02-08 06:41:14,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=110, Unknown=1, NotChecked=22, Total=182 [2025-02-08 06:41:14,958 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 124 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:14,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 105 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 155 Invalid, 0 Unknown, 132 Unchecked, 0.1s Time] [2025-02-08 06:41:14,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-02-08 06:41:14,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 94. [2025-02-08 06:41:14,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 90 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:41:14,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2025-02-08 06:41:14,961 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 44 [2025-02-08 06:41:14,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:14,962 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2025-02-08 06:41:14,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:41:14,962 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2025-02-08 06:41:14,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-08 06:41:14,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:14,962 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:14,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-08 06:41:15,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-08 06:41:15,163 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:41:15,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:15,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1847220100, now seen corresponding path program 1 times [2025-02-08 06:41:15,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:15,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197323858] [2025-02-08 06:41:15,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:15,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:15,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 06:41:15,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 06:41:15,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:15,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:15,754 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:15,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:15,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197323858] [2025-02-08 06:41:15,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197323858] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:15,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108252354] [2025-02-08 06:41:15,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:15,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:15,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:15,758 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:41:15,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 06:41:15,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 06:41:15,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 06:41:15,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:15,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:15,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-02-08 06:41:15,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:15,965 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 [2025-02-08 06:41:15,997 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:41:15,997 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 [2025-02-08 06:41:16,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:41:16,075 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2025-02-08 06:41:16,075 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 34 treesize of output 24 [2025-02-08 06:41:16,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-02-08 06:41:16,269 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:16,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:16,395 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 8 treesize of output 4 [2025-02-08 06:41:16,423 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 25 treesize of output 13 [2025-02-08 06:41:16,426 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 13 treesize of output 11 [2025-02-08 06:41:16,429 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 20 treesize of output 18 [2025-02-08 06:41:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:16,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108252354] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:41:16,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:41:16,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2025-02-08 06:41:16,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866528222] [2025-02-08 06:41:16,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:16,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-08 06:41:16,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:16,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-08 06:41:16,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1437, Unknown=0, NotChecked=0, Total=1560 [2025-02-08 06:41:16,704 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 40 states, 40 states have (on average 1.875) internal successors, (75), 35 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:41:17,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:17,485 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2025-02-08 06:41:17,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 06:41:17,485 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.875) internal successors, (75), 35 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2025-02-08 06:41:17,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:17,486 INFO L225 Difference]: With dead ends: 96 [2025-02-08 06:41:17,486 INFO L226 Difference]: Without dead ends: 94 [2025-02-08 06:41:17,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=222, Invalid=2328, Unknown=0, NotChecked=0, Total=2550 [2025-02-08 06:41:17,487 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 48 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:17,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 692 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 06:41:17,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-08 06:41:17,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-08 06:41:17,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 90 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:41:17,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2025-02-08 06:41:17,490 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 45 [2025-02-08 06:41:17,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:17,490 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2025-02-08 06:41:17,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.875) internal successors, (75), 35 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:41:17,490 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2025-02-08 06:41:17,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 06:41:17,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:17,491 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:17,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-08 06:41:17,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:17,691 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:41:17,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:17,692 INFO L85 PathProgramCache]: Analyzing trace with hash 988495516, now seen corresponding path program 1 times [2025-02-08 06:41:17,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:17,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130224059] [2025-02-08 06:41:17,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:17,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:17,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 06:41:17,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 06:41:17,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:17,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:18,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 06:41:18,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:18,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130224059] [2025-02-08 06:41:18,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130224059] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:18,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692787201] [2025-02-08 06:41:18,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:18,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:18,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:18,478 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:41:18,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-08 06:41:18,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 06:41:18,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 06:41:18,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:18,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:18,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-02-08 06:41:18,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:18,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:41:18,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:18,958 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 [2025-02-08 06:41:19,004 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-02-08 06:41:19,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2025-02-08 06:41:19,221 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 7 treesize of output 3 [2025-02-08 06:41:19,317 INFO L349 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2025-02-08 06:41:19,317 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 58 treesize of output 35 [2025-02-08 06:41:19,487 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 17 treesize of output 9 [2025-02-08 06:41:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 06:41:19,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:19,498 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 06:41:19,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2025-02-08 06:41:19,730 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 34 treesize of output 22 [2025-02-08 06:41:19,732 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 26 treesize of output 18 [2025-02-08 06:41:19,916 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 254 treesize of output 246 [2025-02-08 06:41:20,072 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:41:20,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692787201] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:41:20,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:41:20,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 23] total 55 [2025-02-08 06:41:20,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941672596] [2025-02-08 06:41:20,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:20,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-02-08 06:41:20,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:20,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-02-08 06:41:20,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=2850, Unknown=0, NotChecked=0, Total=3080 [2025-02-08 06:41:20,074 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand has 56 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 51 states have internal predecessors, (84), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 06:41:20,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:20,909 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2025-02-08 06:41:20,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-08 06:41:20,909 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 51 states have internal predecessors, (84), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 46 [2025-02-08 06:41:20,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:20,910 INFO L225 Difference]: With dead ends: 97 [2025-02-08 06:41:20,910 INFO L226 Difference]: Without dead ends: 97 [2025-02-08 06:41:20,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=431, Invalid=4261, Unknown=0, NotChecked=0, Total=4692 [2025-02-08 06:41:20,911 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 98 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:20,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 848 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 06:41:20,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-08 06:41:20,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-08 06:41:20,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 93 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:41:20,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2025-02-08 06:41:20,913 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 46 [2025-02-08 06:41:20,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:20,913 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2025-02-08 06:41:20,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 51 states have internal predecessors, (84), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 06:41:20,914 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2025-02-08 06:41:20,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 06:41:20,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:20,914 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:20,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-08 06:41:21,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-02-08 06:41:21,115 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:41:21,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:21,115 INFO L85 PathProgramCache]: Analyzing trace with hash 988495517, now seen corresponding path program 1 times [2025-02-08 06:41:21,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:21,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056187] [2025-02-08 06:41:21,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:21,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:21,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 06:41:21,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 06:41:21,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:21,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:22,518 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:22,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:22,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056187] [2025-02-08 06:41:22,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056187] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:22,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675437269] [2025-02-08 06:41:22,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:22,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:22,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:22,521 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:41:22,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-08 06:41:22,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 06:41:22,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 06:41:22,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:22,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:22,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-02-08 06:41:22,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:22,776 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 [2025-02-08 06:41:22,944 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 1 [2025-02-08 06:41:23,032 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:41:23,032 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 [2025-02-08 06:41:23,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:41:23,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:41:23,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:23,298 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 [2025-02-08 06:41:23,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:23,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2025-02-08 06:41:23,379 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 [2025-02-08 06:41:23,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-08 06:41:23,730 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 7 treesize of output 3 [2025-02-08 06:41:23,803 INFO L349 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2025-02-08 06:41:23,803 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 85 treesize of output 46 [2025-02-08 06:41:23,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:23,809 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 17 treesize of output 15 [2025-02-08 06:41:23,967 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 17 treesize of output 9 [2025-02-08 06:41:24,008 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:24,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:24,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-02-08 06:41:24,426 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 62 treesize of output 46 [2025-02-08 06:41:24,577 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (forall ((v_ArrVal_2876 (Array Int Int)) (v_ArrVal_2871 Int) (v_ArrVal_2873 Int)) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_2873)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2876) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4)) (select |c_#length| (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_2871)))) (store .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4)))) (forall ((v_ArrVal_2876 (Array Int Int)) (v_ArrVal_2873 Int)) (<= 0 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_2873)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2876) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))))) is different from false [2025-02-08 06:41:24,592 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (forall ((v_ArrVal_2876 (Array Int Int)) (v_ArrVal_2871 Int) (v_ArrVal_2873 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_2873)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2876) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) 4) (select |c_#length| (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_2871)))) (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4)))) (forall ((v_ArrVal_2876 (Array Int Int)) (v_ArrVal_2873 Int)) (<= 0 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_2873)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2876) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))))) is different from false [2025-02-08 06:41:24,622 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2025-02-08 06:41:24,622 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 112 treesize of output 115 [2025-02-08 06:41:24,628 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 438 treesize of output 430 [2025-02-08 06:41:24,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:24,642 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 510 treesize of output 467 [2025-02-08 06:41:24,672 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 304 treesize of output 280 [2025-02-08 06:41:25,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:25,241 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 2 case distinctions, treesize of input 34 treesize of output 27 [2025-02-08 06:41:25,243 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:41:25,245 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-02-08 06:41:25,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675437269] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:25,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:41:25,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 50 [2025-02-08 06:41:25,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557001120] [2025-02-08 06:41:25,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:25,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-02-08 06:41:25,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:25,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-02-08 06:41:25,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=3820, Unknown=23, NotChecked=250, Total=4290 [2025-02-08 06:41:25,500 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 51 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 45 states have internal predecessors, (84), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:41:27,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:27,447 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2025-02-08 06:41:27,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-08 06:41:27,447 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 45 states have internal predecessors, (84), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 46 [2025-02-08 06:41:27,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:27,448 INFO L225 Difference]: With dead ends: 97 [2025-02-08 06:41:27,448 INFO L226 Difference]: Without dead ends: 97 [2025-02-08 06:41:27,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1371 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=458, Invalid=7008, Unknown=24, NotChecked=342, Total=7832 [2025-02-08 06:41:27,450 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 108 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:27,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 836 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 06:41:27,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-08 06:41:27,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-08 06:41:27,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 93 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:41:27,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2025-02-08 06:41:27,455 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 46 [2025-02-08 06:41:27,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:27,455 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2025-02-08 06:41:27,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 45 states have internal predecessors, (84), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:41:27,455 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2025-02-08 06:41:27,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-08 06:41:27,456 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:27,456 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:27,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-08 06:41:27,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:27,657 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:41:27,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:27,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1228579755, now seen corresponding path program 1 times [2025-02-08 06:41:27,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:27,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763448091] [2025-02-08 06:41:27,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:27,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:27,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 06:41:27,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 06:41:27,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:27,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:41:27,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:27,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763448091] [2025-02-08 06:41:27,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763448091] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:27,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805086105] [2025-02-08 06:41:27,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:27,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:27,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:27,827 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:41:27,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-08 06:41:28,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 06:41:28,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 06:41:28,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:28,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:28,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-02-08 06:41:28,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:28,212 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 [2025-02-08 06:41:28,355 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 7 treesize of output 3 [2025-02-08 06:41:28,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 06:41:28,472 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 17 treesize of output 9 [2025-02-08 06:41:28,473 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:41:28,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:28,694 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 39 treesize of output 27 [2025-02-08 06:41:28,696 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 31 treesize of output 23 [2025-02-08 06:41:28,866 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:41:28,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805086105] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:41:28,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:41:28,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15, 14] total 28 [2025-02-08 06:41:28,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364970732] [2025-02-08 06:41:28,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:28,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-08 06:41:28,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:28,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-08 06:41:28,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2025-02-08 06:41:28,867 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand has 29 states, 28 states have (on average 3.6785714285714284) internal successors, (103), 27 states have internal predecessors, (103), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-08 06:41:29,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:29,337 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2025-02-08 06:41:29,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 06:41:29,337 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.6785714285714284) internal successors, (103), 27 states have internal predecessors, (103), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2025-02-08 06:41:29,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:29,338 INFO L225 Difference]: With dead ends: 128 [2025-02-08 06:41:29,338 INFO L226 Difference]: Without dead ends: 128 [2025-02-08 06:41:29,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=224, Invalid=1182, Unknown=0, NotChecked=0, Total=1406 [2025-02-08 06:41:29,339 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 246 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:29,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 369 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:41:29,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-02-08 06:41:29,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 101. [2025-02-08 06:41:29,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 86 states have (on average 1.2674418604651163) internal successors, (109), 97 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:41:29,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2025-02-08 06:41:29,342 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 51 [2025-02-08 06:41:29,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:29,342 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2025-02-08 06:41:29,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.6785714285714284) internal successors, (103), 27 states have internal predecessors, (103), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-08 06:41:29,343 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2025-02-08 06:41:29,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 06:41:29,343 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:29,343 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:29,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-08 06:41:29,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:29,543 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:41:29,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:29,544 INFO L85 PathProgramCache]: Analyzing trace with hash 568714474, now seen corresponding path program 1 times [2025-02-08 06:41:29,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:29,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018205089] [2025-02-08 06:41:29,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:29,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:29,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 06:41:29,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 06:41:29,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:29,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:29,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:41:29,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:29,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018205089] [2025-02-08 06:41:29,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018205089] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:29,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:29,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 06:41:29,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270409287] [2025-02-08 06:41:29,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:29,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:41:29,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:29,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:41:29,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:41:29,653 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:29,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:29,744 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2025-02-08 06:41:29,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 06:41:29,745 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2025-02-08 06:41:29,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:29,745 INFO L225 Difference]: With dead ends: 111 [2025-02-08 06:41:29,745 INFO L226 Difference]: Without dead ends: 109 [2025-02-08 06:41:29,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:41:29,746 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:29,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 322 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:41:29,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-08 06:41:29,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2025-02-08 06:41:29,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 86 states have (on average 1.255813953488372) internal successors, (108), 97 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:41:29,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2025-02-08 06:41:29,749 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 52 [2025-02-08 06:41:29,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:29,749 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2025-02-08 06:41:29,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:29,749 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2025-02-08 06:41:29,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 06:41:29,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:29,749 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:29,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 06:41:29,750 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:41:29,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:29,750 INFO L85 PathProgramCache]: Analyzing trace with hash -512512561, now seen corresponding path program 1 times [2025-02-08 06:41:29,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:29,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125786298] [2025-02-08 06:41:29,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:29,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:29,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 06:41:29,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 06:41:29,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:29,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:30,665 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:41:30,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:30,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125786298] [2025-02-08 06:41:30,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125786298] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:30,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125856266] [2025-02-08 06:41:30,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:30,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:30,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:30,668 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:41:30,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-08 06:41:30,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 06:41:31,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 06:41:31,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:31,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:31,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 153 conjuncts are in the unsatisfiable core [2025-02-08 06:41:31,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:31,139 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 [2025-02-08 06:41:31,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:41:31,183 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 [2025-02-08 06:41:31,378 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:41:31,379 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 [2025-02-08 06:41:31,384 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 [2025-02-08 06:41:31,453 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 [2025-02-08 06:41:31,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:41:31,481 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 19 treesize of output 11 [2025-02-08 06:41:31,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-08 06:41:31,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-08 06:41:31,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-08 06:41:31,625 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 [2025-02-08 06:41:32,271 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:41:32,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:32,273 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 45 [2025-02-08 06:41:32,278 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:41:32,279 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:41:32,293 INFO L349 Elim1Store]: treesize reduction 84, result has 11.6 percent of original size [2025-02-08 06:41:32,293 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 7 case distinctions, treesize of input 103 treesize of output 59 [2025-02-08 06:41:32,472 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 0 case distinctions, treesize of input 85 treesize of output 58 [2025-02-08 06:41:32,479 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 38 treesize of output 36 [2025-02-08 06:41:32,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 25 [2025-02-08 06:41:32,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2025-02-08 06:41:32,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 06:41:32,932 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:32,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:34,110 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 344 treesize of output 252 [2025-02-08 06:41:34,112 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 256 treesize of output 180 [2025-02-08 06:41:34,223 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse3 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse5 .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (and (forall ((v_ArrVal_3297 (Array Int Int))) (= (select (select (let ((.cse2 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store v_ArrVal_3297 .cse3 .cse2)))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (forall ((v_ArrVal_3297 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse5 .cse3 .cse1)))) (store .cse4 .cse1 (store (select .cse4 .cse1) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) is different from false [2025-02-08 06:41:34,267 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse5 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3296)))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse4 .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse4 .cse5 .cse1)))) (store .cse0 .cse1 (store (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5))) (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (= (select (select (let ((.cse11 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)))) (let ((.cse9 (select (select (store .cse11 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse7 (store .cse11 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store v_ArrVal_3297 .cse5 .cse9))) (.cse8 (select (select (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3296)))) (store .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2025-02-08 06:41:34,301 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse0 (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse4 .cse2))) (.cse1 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3296)))) (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (= (select (select (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3296)))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse9 (select (select (store .cse10 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse11 .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse8 (store .cse10 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse11 .cse4 .cse9)))) (store .cse8 .cse9 (store (select .cse8 .cse9) (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2025-02-08 06:41:34,311 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 2964 treesize of output 2948 [2025-02-08 06:41:36,085 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 861 treesize of output 837 [2025-02-08 06:41:40,174 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse183 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse182 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse4 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse182 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (.cse25 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse182 .cse183 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (let ((.cse9 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse182 4 0))) (.cse39 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse26 (select .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse5 (select .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse33 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse20 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) (let ((.cse36 (not .cse20)) (.cse42 (not .cse33)) (.cse34 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse35 (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse14 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse216 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse216) .cse216 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)))) (.cse175 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (= (select (select (let ((.cse215 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse214 (select (select (store .cse215 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse213 (store .cse215 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse214)))) (store .cse213 v_ArrVal_3296 (store (select .cse213 v_ArrVal_3296) .cse214 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (.cse13 (not .cse39)) (.cse10 (select .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse15 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse206 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse206) .cse206 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (let ((.cse209 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse208 (select (select (store .cse209 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse207 (store .cse209 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse208)))) (store .cse207 v_ArrVal_3296 (store (select .cse207 v_ArrVal_3296) .cse208 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (let ((.cse212 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse211 (select (select (store .cse212 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse210 (store .cse212 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse211)))) (store .cse210 v_ArrVal_3296 (store (select .cse210 v_ArrVal_3296) .cse211 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0)))) (.cse16 (or .cse175 .cse13)) (.cse17 (or (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= (select (select (let ((.cse202 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse201 (select (select (store .cse202 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse200 (store .cse202 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse201)))) (store .cse200 v_ArrVal_3296 (store (select .cse200 v_ArrVal_3296) .cse201 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (let ((.cse205 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse204 (select (select (store .cse205 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse203 (store .cse205 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse204)))) (store .cse203 v_ArrVal_3296 (store (select .cse203 v_ArrVal_3296) .cse204 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0))) .cse13)) (.cse12 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (let ((.cse199 (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 4 v_ArrVal_3294)))) (let ((.cse198 (select (select (store .cse199 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse197 (store .cse199 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse198)))) (store .cse197 v_ArrVal_3296 (store (select .cse197 v_ArrVal_3296) .cse198 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)))) (.cse11 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (let ((.cse193 (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 4 v_ArrVal_3294)))) (let ((.cse192 (select (select (store .cse193 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse191 (store .cse193 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse192)))) (store .cse191 v_ArrVal_3296 (store (select .cse191 v_ArrVal_3296) .cse192 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) (= (select (select (let ((.cse196 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse195 (select (select (store .cse196 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse194 (store .cse196 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse195)))) (store .cse194 v_ArrVal_3296 (store (select .cse194 v_ArrVal_3296) .cse195 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0)))) (.cse18 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse187 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse187) .cse187 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (let ((.cse190 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse189 (select (select (store .cse190 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse188 (store .cse190 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse189)))) (store .cse188 v_ArrVal_3296 (store (select .cse188 v_ArrVal_3296) .cse189 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (.cse19 (or .cse39 .cse14)) (.cse0 (not .cse35)) (.cse1 (not .cse34)) (.cse88 (or .cse13 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (or (= (select (select (let ((.cse185 (store .cse10 4 v_ArrVal_3294))) (let ((.cse184 (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse185) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse184)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse185 .cse184 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse186 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 4 v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse186) .cse186 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)))))) (.cse100 (let ((.cse151 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse182 .cse183 0)))) (let ((.cse160 (forall ((v_arrayElimCell_109 Int) (v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= (select (select (let ((.cse178 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse177 (select (select (store .cse178 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse176 (store .cse178 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse177)))) (store .cse176 v_ArrVal_3296 (store (select .cse176 v_ArrVal_3296) .cse177 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (let ((.cse181 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)))) (let ((.cse180 (select (select (store .cse181 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse179 (store .cse181 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse180)))) (store .cse179 v_arrayElimCell_109 (store (select .cse179 v_arrayElimCell_109) .cse180 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (.cse154 (select .cse151 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (forall ((v_arrayElimCell_109 Int) (v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= (select (select (let ((.cse150 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse149 (select (select (store .cse150 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse148 (store .cse150 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse149)))) (store .cse148 v_ArrVal_3296 (store (select .cse148 v_ArrVal_3296) .cse149 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (let ((.cse153 (select (select (store (store .cse151 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse154 4 v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse152 (store v_ArrVal_3297 4 .cse153))) (store (store .cse151 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse152) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse152 .cse153 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= (select (select (let ((.cse157 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)))) (let ((.cse156 (select (select (store .cse157 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse155 (store .cse157 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse156)))) (store .cse155 v_arrayElimCell_109 (store (select .cse155 v_arrayElimCell_109) .cse156 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (= (select (select (let ((.cse159 (select (select (store (store .cse151 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse154 4 v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse158 (store v_ArrVal_3297 4 .cse159))) (store (store .cse151 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse158) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse158 .cse159 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0)) .cse36 .cse42) (or .cse33 .cse160) (or .cse160 .cse20) (or .cse39 (let ((.cse166 (forall ((v_arrayElimCell_109 Int) (v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (= (select (select (let ((.cse169 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)))) (let ((.cse168 (select (select (store .cse169 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse167 (store .cse169 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse168)))) (store .cse167 v_arrayElimCell_109 (store (select .cse167 v_arrayElimCell_109) .cse168 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (and (forall ((v_arrayElimCell_109 Int) (v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (or (= (select (select (let ((.cse162 (select (select (store (store .cse151 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse154 4 v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse161 (store v_ArrVal_3297 4 .cse162))) (store (store .cse151 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse161) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse161 .cse162 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= (select (select (let ((.cse165 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)))) (let ((.cse164 (select (select (store .cse165 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse163 (store .cse165 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse164)))) (store .cse163 v_arrayElimCell_109 (store (select .cse163 v_arrayElimCell_109) .cse164 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or .cse166 .cse33) (or .cse166 .cse20)))) (or .cse13 (and (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= (select (select (let ((.cse172 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse171 (select (select (store .cse172 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse170 (store .cse172 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse171)))) (store .cse170 v_ArrVal_3296 (store (select .cse170 v_ArrVal_3296) .cse171 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (let ((.cse174 (select (select (store (store .cse151 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse154 4 v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse173 (store v_ArrVal_3297 4 .cse174))) (store (store .cse151 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse173) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse173 .cse174 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0))) (or .cse175 .cse33) (or .cse175 .cse20))))))) (.cse72 (or .cse13 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse144 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 4 v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse144) .cse144 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (let ((.cse146 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse147 (select (select (store .cse146 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse145 (store v_ArrVal_3297 4 .cse147))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse145) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse146 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse145) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse147 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0)))))) (and (or (and (or .cse0 .cse1 (and (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse3) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (forall ((v_ArrVal_3296 Int)) (= (select (select (let ((.cse8 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse6 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse7)))) (store .cse6 v_ArrVal_3296 (store (select .cse6 v_ArrVal_3296) .cse7 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0)))) (or (and .cse11 .cse12) .cse13) .cse14)) .cse15 .cse16 .cse17 .cse18 .cse19) .cse20) (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse21 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse21) .cse21 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (let ((.cse24 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse23 (select (select (store .cse24 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse22 (store .cse24 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse23)))) (store .cse22 v_ArrVal_3296 (store (select .cse22 v_ArrVal_3296) .cse23 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (let ((.cse28 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)))) (let ((.cse29 (select (select (store .cse28 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse27 (store v_ArrVal_3297 4 .cse29))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse27) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse28 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse27) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse29 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= (select (select (let ((.cse32 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse31 (select (select (store .cse32 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse30 (store .cse32 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse31)))) (store .cse30 v_ArrVal_3296 (store (select .cse30 v_ArrVal_3296) .cse31 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0))) (or (and .cse33 .cse20) (and .cse34 .cse13 .cse35)) (or .cse36 (and (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (= (select (select (let ((.cse38 (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse37 (store v_ArrVal_3297 4 .cse38))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse37) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse37 .cse38 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0)) (or .cse39 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (= (select (select (let ((.cse41 (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse40 (store v_ArrVal_3297 4 .cse41))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse40) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse40 .cse41 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0)))) .cse42) (or (and (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (let ((.cse49 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse47 (select (select (store .cse49 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse48 (store v_ArrVal_3297 4 .cse47))) (let ((.cse46 (store .cse49 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse48))) (or (forall ((v_ArrVal_3296 Int)) (or (= (select (select (let ((.cse45 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse44 (select (select (store .cse45 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse43 (store .cse45 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse44)))) (store .cse43 v_ArrVal_3296 (store (select .cse43 v_ArrVal_3296) .cse44 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store .cse46 v_ArrVal_3296 (store (select .cse46 v_ArrVal_3296) .cse47 0)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0))) (= (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse48) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse46 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse47 0)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0))))))) (or .cse20 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= (select (select (let ((.cse51 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse52 (select (select (store .cse51 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse50 (store v_ArrVal_3297 4 .cse52))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse50) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse51 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse50) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse52 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= (select (select (let ((.cse55 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse54 (select (select (store .cse55 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse53 (store .cse55 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse54)))) (store .cse53 v_ArrVal_3296 (store (select .cse53 v_ArrVal_3296) .cse54 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (or .cse33 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= (select (select (let ((.cse57 (store .cse10 4 v_ArrVal_3294))) (let ((.cse56 (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse57) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse56)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse57 .cse56 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= (select (select (let ((.cse60 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse59 (select (select (store .cse60 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse58 (store .cse60 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse59)))) (store .cse58 v_ArrVal_3296 (store (select .cse58 v_ArrVal_3296) .cse59 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) .cse13) (or .cse33 (and .cse15 .cse16 .cse17 (or (and (or .cse13 .cse12) (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse61 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse61) .cse61 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (let ((.cse64 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse63 (select (select (store .cse64 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse62 (store .cse64 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse63)))) (store .cse62 v_ArrVal_3296 (store (select .cse62 v_ArrVal_3296) .cse63 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0))) (or .cse13 .cse11) .cse14) .cse0 .cse1) .cse18 .cse19)) (or .cse0 .cse1 (and (or (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (let ((.cse71 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse70 (select (select (store .cse71 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse68 (store v_ArrVal_3297 4 .cse70))) (let ((.cse69 (store .cse71 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse68))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (let ((.cse67 (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 4 v_ArrVal_3294)))) (let ((.cse66 (select (select (store .cse67 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse65 (store .cse67 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse66)))) (store .cse65 v_ArrVal_3296 (store (select .cse65 v_ArrVal_3296) .cse66 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) (= (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse68) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse69 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse70 0)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= (select (select (store .cse69 v_ArrVal_3296 (store (select .cse69 v_ArrVal_3296) .cse70 0)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0))))))) .cse13) (or (and .cse72 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse73 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse73) .cse73 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (let ((.cse75 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse76 (select (select (store .cse75 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse74 (store v_ArrVal_3297 4 .cse76))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse74) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse75 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse74) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse76 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0))) (or .cse13 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (let ((.cse79 (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 4 v_ArrVal_3294)))) (let ((.cse78 (select (select (store .cse79 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse77 (store .cse79 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse78)))) (store .cse77 v_ArrVal_3296 (store (select .cse77 v_ArrVal_3296) .cse78 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) (= (select (select (let ((.cse81 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse82 (select (select (store .cse81 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse80 (store v_ArrVal_3297 4 .cse82))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse80) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse81 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse80) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse82 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0))))) .cse20) (or .cse33 (and (or (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= (select (select (let ((.cse84 (store .cse10 4 v_ArrVal_3294))) (let ((.cse83 (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse84) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse83)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse84 .cse83 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (let ((.cse87 (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 4 v_ArrVal_3294)))) (let ((.cse86 (select (select (store .cse87 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse85 (store .cse87 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse86)))) (store .cse85 v_ArrVal_3296 (store (select .cse85 v_ArrVal_3296) .cse86 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)))) .cse13) .cse88 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (or (= (select (select (let ((.cse90 (store .cse10 4 v_ArrVal_3294))) (let ((.cse89 (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse90) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse89)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse90 .cse89 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse91 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse91) .cse91 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)))))) (or .cse39 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (or (= (select (select (let ((.cse93 (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse92 (store v_ArrVal_3297 4 .cse93))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse92) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse92 .cse93 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse94 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse94) .cse94 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2))))) (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (let ((.cse99 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse98 (select (select (store .cse99 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse96 (store v_ArrVal_3297 4 .cse98))) (let ((.cse97 (store .cse99 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse96))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse95 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse95) .cse95 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse96) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse97 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse98 0)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= (select (select (store .cse97 v_ArrVal_3296 (store (select .cse97 v_ArrVal_3296) .cse98 0)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0))))))))) (or .cse34 .cse100) (or .cse39 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse101 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse101) .cse101 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (let ((.cse103 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)))) (let ((.cse104 (select (select (store .cse103 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse102 (store v_ArrVal_3297 4 .cse104))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse102) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse103 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse102) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse104 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0)))) (or .cse33 (and (or .cse39 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse105 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse105) .cse105 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (let ((.cse107 (store .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294))) (let ((.cse106 (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse107) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse106)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse107 .cse106 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0)))) .cse88 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= (select (select (let ((.cse109 (store .cse10 4 v_ArrVal_3294))) (let ((.cse108 (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse109) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse108)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse109 .cse108 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse110 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse110) .cse110 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (let ((.cse112 (store .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294))) (let ((.cse111 (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse112) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse111)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse112 .cse111 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= (select (select (let ((.cse115 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse114 (select (select (store .cse115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse113 (store .cse115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse114)))) (store .cse113 v_ArrVal_3296 (store (select .cse113 v_ArrVal_3296) .cse114 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or .cse39 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse116 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse116) .cse116 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (let ((.cse118 (store .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294))) (let ((.cse117 (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse118) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse117)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse118 .cse117 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= (select (select (let ((.cse121 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse120 (select (select (store .cse121 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse119 (store .cse121 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse120)))) (store .cse119 v_ArrVal_3296 (store (select .cse119 v_ArrVal_3296) .cse120 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) (or .cse100 .cse35) (or .cse20 (and (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse122 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse122) .cse122 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (let ((.cse124 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse125 (select (select (store .cse124 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse123 (store v_ArrVal_3297 4 .cse125))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse123) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse124 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse123) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse125 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= (select (select (let ((.cse128 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse127 (select (select (store .cse128 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse126 (store .cse128 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse127)))) (store .cse126 v_ArrVal_3296 (store (select .cse126 v_ArrVal_3296) .cse127 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (let ((.cse130 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)))) (let ((.cse131 (select (select (store .cse130 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse129 (store v_ArrVal_3297 4 .cse131))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse129) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse130 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse129) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse131 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0))) .cse72 (or .cse39 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse132 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse132) .cse132 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (let ((.cse135 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse134 (select (select (store .cse135 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse133 (store .cse135 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse134)))) (store .cse133 v_ArrVal_3296 (store (select .cse133 v_ArrVal_3296) .cse134 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (let ((.cse137 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)))) (let ((.cse138 (select (select (store .cse137 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse136 (store v_ArrVal_3297 4 .cse138))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse136) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse137 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse136) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse138 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0)))))) (or .cse13 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (let ((.cse143 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse142 (select (select (store .cse143 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse140 (store v_ArrVal_3297 4 .cse142))) (let ((.cse141 (store .cse143 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse140))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse139 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 4 v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse139) .cse139 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse140) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse141 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse142 0)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= (select (select (store .cse141 v_ArrVal_3296 (store (select .cse141 v_ArrVal_3296) .cse142 0)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0)))))))))))))) is different from false [2025-02-08 06:41:44,201 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse183 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse182 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse4 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse182 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (.cse25 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse182 .cse183 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (let ((.cse9 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse182 4 0))) (.cse39 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse26 (select .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse5 (select .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse33 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse20 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) (let ((.cse36 (not .cse20)) (.cse42 (not .cse33)) (.cse34 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse35 (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse14 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse216 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse216) .cse216 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)))) (.cse175 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (= (select (select (let ((.cse215 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse214 (select (select (store .cse215 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse213 (store .cse215 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse214)))) (store .cse213 v_ArrVal_3296 (store (select .cse213 v_ArrVal_3296) .cse214 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (.cse13 (not .cse39)) (.cse10 (select .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse15 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse206 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse206) .cse206 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (let ((.cse209 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse208 (select (select (store .cse209 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse207 (store .cse209 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse208)))) (store .cse207 v_ArrVal_3296 (store (select .cse207 v_ArrVal_3296) .cse208 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (let ((.cse212 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse211 (select (select (store .cse212 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse210 (store .cse212 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse211)))) (store .cse210 v_ArrVal_3296 (store (select .cse210 v_ArrVal_3296) .cse211 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0)))) (.cse16 (or .cse175 .cse13)) (.cse17 (or (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= (select (select (let ((.cse202 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse201 (select (select (store .cse202 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse200 (store .cse202 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse201)))) (store .cse200 v_ArrVal_3296 (store (select .cse200 v_ArrVal_3296) .cse201 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (let ((.cse205 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse204 (select (select (store .cse205 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse203 (store .cse205 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse204)))) (store .cse203 v_ArrVal_3296 (store (select .cse203 v_ArrVal_3296) .cse204 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0))) .cse13)) (.cse12 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (let ((.cse199 (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 4 v_ArrVal_3294)))) (let ((.cse198 (select (select (store .cse199 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse197 (store .cse199 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse198)))) (store .cse197 v_ArrVal_3296 (store (select .cse197 v_ArrVal_3296) .cse198 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)))) (.cse11 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (let ((.cse193 (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 4 v_ArrVal_3294)))) (let ((.cse192 (select (select (store .cse193 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse191 (store .cse193 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse192)))) (store .cse191 v_ArrVal_3296 (store (select .cse191 v_ArrVal_3296) .cse192 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) (= (select (select (let ((.cse196 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse195 (select (select (store .cse196 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse194 (store .cse196 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse195)))) (store .cse194 v_ArrVal_3296 (store (select .cse194 v_ArrVal_3296) .cse195 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0)))) (.cse18 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse187 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse187) .cse187 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (let ((.cse190 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse189 (select (select (store .cse190 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse188 (store .cse190 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse189)))) (store .cse188 v_ArrVal_3296 (store (select .cse188 v_ArrVal_3296) .cse189 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (.cse19 (or .cse39 .cse14)) (.cse0 (not .cse35)) (.cse1 (not .cse34)) (.cse88 (or .cse13 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (or (= (select (select (let ((.cse185 (store .cse10 4 v_ArrVal_3294))) (let ((.cse184 (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse185) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse184)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse185 .cse184 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse186 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 4 v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse186) .cse186 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)))))) (.cse100 (let ((.cse151 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse182 .cse183 0)))) (let ((.cse160 (forall ((v_arrayElimCell_109 Int) (v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= (select (select (let ((.cse178 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse177 (select (select (store .cse178 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse176 (store .cse178 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse177)))) (store .cse176 v_ArrVal_3296 (store (select .cse176 v_ArrVal_3296) .cse177 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (let ((.cse181 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)))) (let ((.cse180 (select (select (store .cse181 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse179 (store .cse181 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse180)))) (store .cse179 v_arrayElimCell_109 (store (select .cse179 v_arrayElimCell_109) .cse180 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (.cse154 (select .cse151 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (forall ((v_arrayElimCell_109 Int) (v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= (select (select (let ((.cse150 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse149 (select (select (store .cse150 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse148 (store .cse150 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse149)))) (store .cse148 v_ArrVal_3296 (store (select .cse148 v_ArrVal_3296) .cse149 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (let ((.cse153 (select (select (store (store .cse151 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse154 4 v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse152 (store v_ArrVal_3297 4 .cse153))) (store (store .cse151 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse152) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse152 .cse153 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= (select (select (let ((.cse157 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)))) (let ((.cse156 (select (select (store .cse157 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse155 (store .cse157 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse156)))) (store .cse155 v_arrayElimCell_109 (store (select .cse155 v_arrayElimCell_109) .cse156 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (= (select (select (let ((.cse159 (select (select (store (store .cse151 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse154 4 v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse158 (store v_ArrVal_3297 4 .cse159))) (store (store .cse151 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse158) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse158 .cse159 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0)) .cse36 .cse42) (or .cse33 .cse160) (or .cse160 .cse20) (or .cse39 (let ((.cse166 (forall ((v_arrayElimCell_109 Int) (v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (= (select (select (let ((.cse169 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)))) (let ((.cse168 (select (select (store .cse169 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse167 (store .cse169 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse168)))) (store .cse167 v_arrayElimCell_109 (store (select .cse167 v_arrayElimCell_109) .cse168 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (and (forall ((v_arrayElimCell_109 Int) (v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (or (= (select (select (let ((.cse162 (select (select (store (store .cse151 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse154 4 v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse161 (store v_ArrVal_3297 4 .cse162))) (store (store .cse151 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse161) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse161 .cse162 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= (select (select (let ((.cse165 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)))) (let ((.cse164 (select (select (store .cse165 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse163 (store .cse165 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse164)))) (store .cse163 v_arrayElimCell_109 (store (select .cse163 v_arrayElimCell_109) .cse164 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or .cse166 .cse33) (or .cse166 .cse20)))) (or .cse13 (and (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= (select (select (let ((.cse172 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse171 (select (select (store .cse172 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse170 (store .cse172 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse171)))) (store .cse170 v_ArrVal_3296 (store (select .cse170 v_ArrVal_3296) .cse171 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (let ((.cse174 (select (select (store (store .cse151 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse154 4 v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse173 (store v_ArrVal_3297 4 .cse174))) (store (store .cse151 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse173) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse173 .cse174 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0))) (or .cse175 .cse33) (or .cse175 .cse20))))))) (.cse72 (or .cse13 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse144 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 4 v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse144) .cse144 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (let ((.cse146 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse147 (select (select (store .cse146 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse145 (store v_ArrVal_3297 4 .cse147))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse145) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse146 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse145) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse147 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0)))))) (and (or (and (or .cse0 .cse1 (and (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse3) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (forall ((v_ArrVal_3296 Int)) (= (select (select (let ((.cse8 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse6 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse7)))) (store .cse6 v_ArrVal_3296 (store (select .cse6 v_ArrVal_3296) .cse7 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0)))) (or (and .cse11 .cse12) .cse13) .cse14)) .cse15 .cse16 .cse17 .cse18 .cse19) .cse20) (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse21 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse21) .cse21 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (let ((.cse24 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse23 (select (select (store .cse24 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse22 (store .cse24 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse23)))) (store .cse22 v_ArrVal_3296 (store (select .cse22 v_ArrVal_3296) .cse23 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (let ((.cse28 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)))) (let ((.cse29 (select (select (store .cse28 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse27 (store v_ArrVal_3297 4 .cse29))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse27) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse28 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse27) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse29 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= (select (select (let ((.cse32 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse31 (select (select (store .cse32 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse30 (store .cse32 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse31)))) (store .cse30 v_ArrVal_3296 (store (select .cse30 v_ArrVal_3296) .cse31 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0))) (or (and .cse33 .cse20) (and .cse34 .cse13 .cse35)) (or .cse36 (and (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (= (select (select (let ((.cse38 (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse37 (store v_ArrVal_3297 4 .cse38))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse37) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse37 .cse38 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0)) (or .cse39 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (= (select (select (let ((.cse41 (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse40 (store v_ArrVal_3297 4 .cse41))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse40) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse40 .cse41 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0)))) .cse42) (or (and (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (let ((.cse49 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse47 (select (select (store .cse49 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse48 (store v_ArrVal_3297 4 .cse47))) (let ((.cse46 (store .cse49 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse48))) (or (forall ((v_ArrVal_3296 Int)) (or (= (select (select (let ((.cse45 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse44 (select (select (store .cse45 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse43 (store .cse45 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse44)))) (store .cse43 v_ArrVal_3296 (store (select .cse43 v_ArrVal_3296) .cse44 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store .cse46 v_ArrVal_3296 (store (select .cse46 v_ArrVal_3296) .cse47 0)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0))) (= (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse48) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse46 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse47 0)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0))))))) (or .cse20 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= (select (select (let ((.cse51 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse52 (select (select (store .cse51 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse50 (store v_ArrVal_3297 4 .cse52))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse50) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse51 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse50) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse52 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= (select (select (let ((.cse55 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse54 (select (select (store .cse55 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse53 (store .cse55 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse54)))) (store .cse53 v_ArrVal_3296 (store (select .cse53 v_ArrVal_3296) .cse54 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (or .cse33 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= (select (select (let ((.cse57 (store .cse10 4 v_ArrVal_3294))) (let ((.cse56 (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse57) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse56)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse57 .cse56 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= (select (select (let ((.cse60 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse59 (select (select (store .cse60 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse58 (store .cse60 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse59)))) (store .cse58 v_ArrVal_3296 (store (select .cse58 v_ArrVal_3296) .cse59 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) .cse13) (or .cse33 (and .cse15 .cse16 .cse17 (or (and (or .cse13 .cse12) (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse61 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse61) .cse61 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (let ((.cse64 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse63 (select (select (store .cse64 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse62 (store .cse64 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse63)))) (store .cse62 v_ArrVal_3296 (store (select .cse62 v_ArrVal_3296) .cse63 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0))) (or .cse13 .cse11) .cse14) .cse0 .cse1) .cse18 .cse19)) (or .cse0 .cse1 (and (or (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (let ((.cse71 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse70 (select (select (store .cse71 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse68 (store v_ArrVal_3297 4 .cse70))) (let ((.cse69 (store .cse71 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse68))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (let ((.cse67 (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 4 v_ArrVal_3294)))) (let ((.cse66 (select (select (store .cse67 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse65 (store .cse67 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse66)))) (store .cse65 v_ArrVal_3296 (store (select .cse65 v_ArrVal_3296) .cse66 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) (= (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse68) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse69 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse70 0)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= (select (select (store .cse69 v_ArrVal_3296 (store (select .cse69 v_ArrVal_3296) .cse70 0)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0))))))) .cse13) (or (and .cse72 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse73 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse73) .cse73 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (let ((.cse75 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse76 (select (select (store .cse75 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse74 (store v_ArrVal_3297 4 .cse76))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse74) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse75 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse74) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse76 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0))) (or .cse13 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (let ((.cse79 (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 4 v_ArrVal_3294)))) (let ((.cse78 (select (select (store .cse79 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse77 (store .cse79 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse78)))) (store .cse77 v_ArrVal_3296 (store (select .cse77 v_ArrVal_3296) .cse78 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) (= (select (select (let ((.cse81 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse82 (select (select (store .cse81 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse80 (store v_ArrVal_3297 4 .cse82))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse80) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse81 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse80) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse82 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0))))) .cse20) (or .cse33 (and (or (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= (select (select (let ((.cse84 (store .cse10 4 v_ArrVal_3294))) (let ((.cse83 (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse84) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse83)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse84 .cse83 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (let ((.cse87 (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 4 v_ArrVal_3294)))) (let ((.cse86 (select (select (store .cse87 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse85 (store .cse87 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse86)))) (store .cse85 v_ArrVal_3296 (store (select .cse85 v_ArrVal_3296) .cse86 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)))) .cse13) .cse88 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (or (= (select (select (let ((.cse90 (store .cse10 4 v_ArrVal_3294))) (let ((.cse89 (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse90) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse89)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse90 .cse89 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse91 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse91) .cse91 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)))))) (or .cse39 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (or (= (select (select (let ((.cse93 (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse92 (store v_ArrVal_3297 4 .cse93))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse92) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse92 .cse93 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse94 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse94) .cse94 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2))))) (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (let ((.cse99 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse98 (select (select (store .cse99 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse96 (store v_ArrVal_3297 4 .cse98))) (let ((.cse97 (store .cse99 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse96))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse95 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse95) .cse95 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse96) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse97 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse98 0)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= (select (select (store .cse97 v_ArrVal_3296 (store (select .cse97 v_ArrVal_3296) .cse98 0)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0))))))))) (or .cse34 .cse100) (or .cse39 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse101 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse101) .cse101 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (let ((.cse103 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)))) (let ((.cse104 (select (select (store .cse103 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse102 (store v_ArrVal_3297 4 .cse104))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse102) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse103 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse102) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse104 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0)))) (or .cse33 (and (or .cse39 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse105 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse105) .cse105 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (let ((.cse107 (store .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294))) (let ((.cse106 (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse107) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse106)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse107 .cse106 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0)))) .cse88 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= (select (select (let ((.cse109 (store .cse10 4 v_ArrVal_3294))) (let ((.cse108 (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse109) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse108)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse109 .cse108 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse110 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse110) .cse110 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (let ((.cse112 (store .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294))) (let ((.cse111 (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse112) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse111)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse112 .cse111 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= (select (select (let ((.cse115 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse114 (select (select (store .cse115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse113 (store .cse115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse114)))) (store .cse113 v_ArrVal_3296 (store (select .cse113 v_ArrVal_3296) .cse114 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or .cse39 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse116 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse116) .cse116 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (let ((.cse118 (store .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294))) (let ((.cse117 (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse118) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse117)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse118 .cse117 0)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= (select (select (let ((.cse121 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse120 (select (select (store .cse121 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse119 (store .cse121 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse120)))) (store .cse119 v_ArrVal_3296 (store (select .cse119 v_ArrVal_3296) .cse120 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) (or .cse100 .cse35) (or .cse20 (and (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse122 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse122) .cse122 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (let ((.cse124 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse125 (select (select (store .cse124 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse123 (store v_ArrVal_3297 4 .cse125))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse123) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse124 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse123) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse125 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= (select (select (let ((.cse128 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse127 (select (select (store .cse128 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse126 (store .cse128 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse127)))) (store .cse126 v_ArrVal_3296 (store (select .cse126 v_ArrVal_3296) .cse127 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (let ((.cse130 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)))) (let ((.cse131 (select (select (store .cse130 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse129 (store v_ArrVal_3297 4 .cse131))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse129) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse130 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse129) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse131 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0))) .cse72 (or .cse39 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse132 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse132) .cse132 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (let ((.cse135 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse26 4 v_ArrVal_3294)))) (let ((.cse134 (select (select (store .cse135 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse133 (store .cse135 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 .cse2 .cse134)))) (store .cse133 v_ArrVal_3296 (store (select .cse133 v_ArrVal_3296) .cse134 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (let ((.cse137 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)))) (let ((.cse138 (select (select (store .cse137 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse136 (store v_ArrVal_3297 4 .cse138))) (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse136) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse137 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse136) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse138 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0)))))) (or .cse13 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (let ((.cse143 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse10 4 v_ArrVal_3294)))) (let ((.cse142 (select (select (store .cse143 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse140 (store v_ArrVal_3297 4 .cse142))) (let ((.cse141 (store .cse143 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse140))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse139 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 4 v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse2 .cse139) .cse139 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse2)) (= (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse140) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse141 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse142 0)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= (select (select (store .cse141 v_ArrVal_3296 (store (select .cse141 v_ArrVal_3296) .cse142 0)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0)))))))))))))) is different from true [2025-02-08 06:41:46,660 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse45 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (let ((.cse4 (not .cse45)) (.cse11 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse5 (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse0 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3294 Int)) (let ((.cse59 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3289))) (or (= (select (select (let ((.cse60 (store v_ArrVal_3289 4 0))) (let ((.cse56 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse60))) (let ((.cse58 (select (select (store (store .cse56 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse59 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse60) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse57 (store v_ArrVal_3297 4 .cse58))) (store (store .cse56 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse57) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse57 .cse58 0)))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse61 (select (select (store (let ((.cse62 (store (select .cse59 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse62) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse59 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse62) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse13 .cse61) .cse61 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse13)))))) (.cse3 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse12 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3294 Int)) (= (select (select (let ((.cse54 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3289))) (let ((.cse55 (store (select .cse54 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 4 0))) (let ((.cse51 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse55))) (let ((.cse53 (select (select (store (store .cse51 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse54 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse55) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse52 (store v_ArrVal_3297 4 .cse53))) (store (store .cse51 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse52) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse52 .cse53 0))))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0))) (.cse2 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (or .cse0 .cse1) (or (and .cse2 .cse1) (and .cse3 .cse4 .cse5)) (or .cse5 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3294 Int)) (= (select (select (let ((.cse9 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3289))) (let ((.cse10 (store (select .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse11 0))) (let ((.cse6 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse10))) (let ((.cse8 (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse10) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse7 (store v_ArrVal_3297 4 .cse8))) (store (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse7) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse7 .cse8 0))))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0))) (or .cse12 .cse4) (or (and (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3294 Int)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse14 (select (select (store (let ((.cse16 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3289))) (let ((.cse15 (store (select .cse16 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse15) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse16 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse15) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse13 .cse14) .cse14 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse13))) (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3294 Int)) (let ((.cse19 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3289))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse17 (select (select (store (let ((.cse18 (store .cse20 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse18) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse19 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse18) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse13 .cse17) .cse17 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse13)) (forall ((v_ArrVal_3296 Int)) (= (select (select (let ((.cse23 (let ((.cse24 (store .cse20 4 0))) (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse24) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse19 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse24) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_3294))))) (let ((.cse22 (select (select (store .cse23 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse21 (store .cse23 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse22)))) (store .cse21 v_ArrVal_3296 (store (select .cse21 v_ArrVal_3296) .cse22 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0)))))) (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (let ((.cse27 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3289))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse25 (select (select (store (let ((.cse26 (store .cse28 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse26) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse27 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse26) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse13 .cse25) .cse25 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse13)) (= (select (select (let ((.cse31 (let ((.cse32 (store .cse28 4 0))) (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse32) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse27 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse32) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_3294))))) (let ((.cse30 (select (select (store .cse31 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse29 (store .cse31 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3297 4 .cse30)))) (store .cse29 v_ArrVal_3296 (store (select .cse29 v_ArrVal_3296) .cse30 0))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0)))))) .cse1) (or .cse3 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3294 Int)) (= 0 (select (select (let ((.cse36 (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse11 0))) (let ((.cse33 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse36))) (let ((.cse35 (select (select (store (store .cse33 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3289) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse36) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse34 (store v_ArrVal_3297 4 .cse35))) (store (store .cse33 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse34) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse34 .cse35 0)))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4)))) (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3294 Int)) (let ((.cse39 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3289))) (let ((.cse40 (select .cse39 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (let ((.cse37 (select (select (store (let ((.cse38 (store .cse40 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse38) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse39 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse38) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse13 .cse37) .cse37 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse13)) (= (select (select (let ((.cse44 (store .cse40 4 0))) (let ((.cse41 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse44))) (let ((.cse43 (select (select (store (store .cse41 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse39 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse44) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse42 (store v_ArrVal_3297 4 .cse43))) (store (store .cse41 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse42) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse42 .cse43 0)))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0))))) (or (not .cse5) .cse0 (not .cse3)) (or (not .cse1) (and .cse12 (or .cse45 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3294 Int)) (= (select (select (let ((.cse49 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3289))) (let ((.cse50 (store (select .cse49 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 4 0))) (let ((.cse46 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse50))) (let ((.cse48 (select (select (store (store .cse46 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse49 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse50) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse47 (store v_ArrVal_3297 4 .cse48))) (store (store .cse46 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse47) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse47 .cse48 0))))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0)))) (not .cse2))))) is different from false [2025-02-08 06:41:47,021 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse45 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse12 (+ |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 4))) (let ((.cse10 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3294 Int)) (let ((.cse58 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| v_ArrVal_3289))) (or (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| (select (let ((.cse56 (select (select (store (let ((.cse57 (store (select .cse58 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 4 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset|))) (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse57) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse58 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse57) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294))) |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse12 .cse56) .cse56 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset|)) .cse12)) (= (select (select (let ((.cse62 (store v_ArrVal_3289 4 0))) (let ((.cse59 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse62))) (let ((.cse61 (select (select (store (store .cse59 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse58 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse62) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse60 (store v_ArrVal_3297 4 .cse61))) (store (store .cse59 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| .cse60) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse60 .cse61 0)))))) |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 4) 0))))) (.cse1 (not .cse45)) (.cse8 (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse11 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse7 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse32 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (.cse0 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3294 Int)) (= (select (select (let ((.cse54 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| v_ArrVal_3289))) (let ((.cse55 (store (select .cse54 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 4 0))) (let ((.cse51 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse55))) (let ((.cse53 (select (select (store (store .cse51 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse54 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse55) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse52 (store v_ArrVal_3297 4 .cse53))) (store (store .cse51 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| .cse52) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse52 .cse53 0))))))) |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 4) 0))) (.cse9 (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0))) (and (or .cse0 .cse1) (or (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3294 Int)) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| v_ArrVal_3289))) (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse7 0))) (let ((.cse2 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse6))) (let ((.cse4 (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse6) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse3 (store v_ArrVal_3297 4 .cse4))) (store (store .cse2 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| .cse3) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse3 .cse4 0))))))) |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 4) 0)) .cse8) (or .cse9 .cse10) (or (not .cse8) (not .cse11) .cse10) (or (and (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3296 Int) (v_ArrVal_3294 Int)) (let ((.cse15 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| v_ArrVal_3289))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| (select (let ((.cse13 (select (select (store (let ((.cse14 (store .cse16 4 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset|))) (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse14) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse15 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse14) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294))) |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse12 .cse13) .cse13 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset|)) .cse12)) (= (select (select (let ((.cse19 (let ((.cse20 (store .cse16 4 0))) (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse20) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse15 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse20) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_3294))))) (let ((.cse18 (select (select (store .cse19 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse17 (store .cse19 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| (store v_ArrVal_3297 4 .cse18)))) (store .cse17 v_ArrVal_3296 (store (select .cse17 v_ArrVal_3296) .cse18 0))))) |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 4) 0))))) (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3294 Int)) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| (select (let ((.cse21 (select (select (store (let ((.cse23 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| v_ArrVal_3289))) (let ((.cse22 (store (select .cse23 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 4 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset|))) (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse22) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse23 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse22) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)))) |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse12 .cse21) .cse21 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset|)) .cse12))) (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3294 Int)) (let ((.cse28 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| v_ArrVal_3289))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (or (forall ((v_ArrVal_3296 Int)) (= (select (select (let ((.cse26 (let ((.cse27 (store .cse29 4 0))) (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse27) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse27) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_3294))))) (let ((.cse25 (select (select (store .cse26 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse24 (store .cse26 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| (store v_ArrVal_3297 4 .cse25)))) (store .cse24 v_ArrVal_3296 (store (select .cse24 v_ArrVal_3296) .cse25 0))))) |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 4) 0)) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| (select (let ((.cse30 (select (select (store (let ((.cse31 (store .cse29 4 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset|))) (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse31) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse31) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294))) |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse12 .cse30) .cse30 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset|)) .cse12))))))) .cse9) (or (and .cse32 .cse9) (and .cse11 .cse1 .cse8)) (or .cse11 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3294 Int)) (= (select (select (let ((.cse36 (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse7 0))) (let ((.cse33 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse36))) (let ((.cse35 (select (select (store (store .cse33 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| v_ArrVal_3289) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse36) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse34 (store v_ArrVal_3297 4 .cse35))) (store (store .cse33 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| .cse34) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse34 .cse35 0)))))) |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 4) 0))) (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3294 Int)) (let ((.cse39 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| v_ArrVal_3289))) (let ((.cse40 (select .cse39 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| (select (let ((.cse37 (select (select (store (let ((.cse38 (store .cse40 4 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset|))) (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse38) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse39 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse38) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294))) |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store (store v_ArrVal_3297 .cse12 .cse37) .cse37 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset|)) .cse12)) (= (select (select (let ((.cse44 (store .cse40 4 0))) (let ((.cse41 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse44))) (let ((.cse43 (select (select (store (store .cse41 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse39 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse44) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse42 (store v_ArrVal_3297 4 .cse43))) (store (store .cse41 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| .cse42) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse42 .cse43 0)))))) |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 4) 0))))) (or (not .cse32) (and .cse0 (or .cse45 (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3294 Int)) (= (select (select (let ((.cse49 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| v_ArrVal_3289))) (let ((.cse50 (store (select .cse49 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 4 0))) (let ((.cse46 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse50))) (let ((.cse48 (select (select (store (store .cse46 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse49 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse50) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3294)) |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| v_ArrVal_3297) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse47 (store v_ArrVal_3297 4 .cse48))) (store (store .cse46 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| .cse47) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse47 .cse48 0))))))) |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 4) 0)))) (not .cse9))))) is different from false [2025-02-08 06:41:48,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125856266] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:48,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:41:48,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 35] total 51 [2025-02-08 06:41:48,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405695959] [2025-02-08 06:41:48,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:48,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-02-08 06:41:48,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:48,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-02-08 06:41:48,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=4691, Unknown=10, NotChecked=858, Total=5852 [2025-02-08 06:41:48,183 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 51 states, 50 states have (on average 2.04) internal successors, (102), 47 states have internal predecessors, (102), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:41:58,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:58,594 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2025-02-08 06:41:58,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-08 06:41:58,595 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.04) internal successors, (102), 47 states have internal predecessors, (102), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 55 [2025-02-08 06:41:58,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:58,595 INFO L225 Difference]: With dead ends: 111 [2025-02-08 06:41:58,595 INFO L226 Difference]: Without dead ends: 111 [2025-02-08 06:41:58,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2518 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=711, Invalid=9005, Unknown=10, NotChecked=1194, Total=10920 [2025-02-08 06:41:58,599 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 158 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:58,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 564 Invalid, 1732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1719 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-02-08 06:41:58,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-08 06:41:58,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2025-02-08 06:41:58,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 80 states have (on average 1.2125) internal successors, (97), 91 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:41:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2025-02-08 06:41:58,602 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 55 [2025-02-08 06:41:58,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:58,602 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2025-02-08 06:41:58,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.04) internal successors, (102), 47 states have internal predecessors, (102), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:41:58,603 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2025-02-08 06:41:58,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-08 06:41:58,603 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:58,603 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:58,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-02-08 06:41:58,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:58,804 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:41:58,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:58,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1045141593, now seen corresponding path program 1 times [2025-02-08 06:41:58,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:58,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166104013] [2025-02-08 06:41:58,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:58,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:58,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 06:41:58,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 06:41:58,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:58,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:59,035 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 06:41:59,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:59,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166104013] [2025-02-08 06:41:59,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166104013] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:59,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367074290] [2025-02-08 06:41:59,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:59,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:59,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:59,037 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:41:59,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-08 06:41:59,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 06:41:59,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 06:41:59,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:59,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:59,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 06:41:59,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:59,780 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:41:59,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:41:59,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367074290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:59,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:41:59,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2025-02-08 06:41:59,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769871879] [2025-02-08 06:41:59,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:59,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:41:59,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:59,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:41:59,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:41:59,782 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:59,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:59,837 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2025-02-08 06:41:59,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:41:59,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2025-02-08 06:41:59,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:59,838 INFO L225 Difference]: With dead ends: 57 [2025-02-08 06:41:59,838 INFO L226 Difference]: Without dead ends: 57 [2025-02-08 06:41:59,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:41:59,838 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:59,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:41:59,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-08 06:41:59,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-08 06:41:59,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 53 states have (on average 1.0) internal successors, (53), 53 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:41:59,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2025-02-08 06:41:59,840 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 63 [2025-02-08 06:41:59,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:59,840 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2025-02-08 06:41:59,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:59,840 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2025-02-08 06:41:59,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-08 06:41:59,841 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:59,841 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:59,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-02-08 06:42:00,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-02-08 06:42:00,041 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-08 06:42:00,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:00,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1960367801, now seen corresponding path program 1 times [2025-02-08 06:42:00,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:00,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94890860] [2025-02-08 06:42:00,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:00,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:00,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 06:42:00,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 06:42:00,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:00,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:05,410 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:42:05,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:05,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94890860] [2025-02-08 06:42:05,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94890860] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:05,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030412335] [2025-02-08 06:42:05,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:05,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:05,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:05,412 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:42:05,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-08 06:42:05,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 06:42:05,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 06:42:05,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:05,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:05,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 123 conjuncts are in the unsatisfiable core [2025-02-08 06:42:05,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:05,909 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 [2025-02-08 06:42:06,841 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 06:42:06,841 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 23 treesize of output 19 [2025-02-08 06:42:08,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1