./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 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_update_all.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 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:40:49,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:40:49,382 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:40:49,385 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:40:49,388 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:40:49,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:40:49,409 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:40:49,409 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:40:49,410 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:40:49,410 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:40:49,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:40:49,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:40:49,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:40:49,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:40:49,411 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:40:49,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:40:49,411 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:40:49,411 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:40:49,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:40:49,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:40:49,411 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:40:49,411 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:40:49,411 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:40:49,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:40:49,412 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:40:49,412 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:40:49,412 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:40:49,412 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:40:49,412 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:40:49,412 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:40:49,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:40:49,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:40:49,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:40:49,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:40:49,412 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:40:49,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:40:49,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:40:49,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:40:49,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:40:49,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:40:49,412 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:40:49,412 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:40:49,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:40:49,413 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:40:49,413 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:40:49,414 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:40:49,414 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:40:49,414 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 -> 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 [2025-01-09 22:40:49,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:40:49,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:40:49,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:40:49,644 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:40:49,645 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:40:49,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_update_all.i [2025-01-09 22:40:50,764 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0bb2cd519/da3d55ee82064208b7eee488884fac38/FLAG4f2e37ec9 [2025-01-09 22:40:51,049 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:40:51,050 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all.i [2025-01-09 22:40:51,064 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0bb2cd519/da3d55ee82064208b7eee488884fac38/FLAG4f2e37ec9 [2025-01-09 22:40:51,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0bb2cd519/da3d55ee82064208b7eee488884fac38 [2025-01-09 22:40:51,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:40:51,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:40:51,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:40:51,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:40:51,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:40:51,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:40:51" (1/1) ... [2025-01-09 22:40:51,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f57c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:40:51, skipping insertion in model container [2025-01-09 22:40:51,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:40:51" (1/1) ... [2025-01-09 22:40:51,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:40:51,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:40:51,614 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:40:51,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:40:51,676 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:40:51,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:40:51 WrapperNode [2025-01-09 22:40:51,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:40:51,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:40:51,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:40:51,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:40:51,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:40:51" (1/1) ... [2025-01-09 22:40:51,692 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:40:51" (1/1) ... [2025-01-09 22:40:51,704 INFO L138 Inliner]: procedures = 126, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2025-01-09 22:40:51,705 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:40:51,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:40:51,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:40:51,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:40:51,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:40:51" (1/1) ... [2025-01-09 22:40:51,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:40:51" (1/1) ... [2025-01-09 22:40:51,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:40:51" (1/1) ... [2025-01-09 22:40:51,729 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [2, 13]. 87 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 8 writes are split as follows [0, 8]. [2025-01-09 22:40:51,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:40:51" (1/1) ... [2025-01-09 22:40:51,729 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:40:51" (1/1) ... [2025-01-09 22:40:51,734 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:40:51" (1/1) ... [2025-01-09 22:40:51,735 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:40:51" (1/1) ... [2025-01-09 22:40:51,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:40:51" (1/1) ... [2025-01-09 22:40:51,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:40:51" (1/1) ... [2025-01-09 22:40:51,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:40:51" (1/1) ... [2025-01-09 22:40:51,743 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:40:51,744 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:40:51,744 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:40:51,744 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:40:51,745 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:40:51" (1/1) ... [2025-01-09 22:40:51,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:40:51,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:40:51,767 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-01-09 22:40:51,770 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-01-09 22:40:51,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:40:51,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:40:51,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:40:51,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:40:51,787 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-01-09 22:40:51,787 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-01-09 22:40:51,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:40:51,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:40:51,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:40:51,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:40:51,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:40:51,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:40:51,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:40:51,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:40:51,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:40:51,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:40:51,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:40:51,874 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:40:51,875 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:40:52,111 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2025-01-09 22:40:52,111 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:40:52,123 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:40:52,123 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 22:40:52,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:40:52 BoogieIcfgContainer [2025-01-09 22:40:52,124 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:40:52,125 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:40:52,125 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:40:52,129 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:40:52,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:40:51" (1/3) ... [2025-01-09 22:40:52,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d20978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:40:52, skipping insertion in model container [2025-01-09 22:40:52,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:40:51" (2/3) ... [2025-01-09 22:40:52,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d20978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:40:52, skipping insertion in model container [2025-01-09 22:40:52,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:40:52" (3/3) ... [2025-01-09 22:40:52,132 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2025-01-09 22:40:52,143 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:40:52,144 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_update_all.i that has 2 procedures, 92 locations, 1 initial locations, 6 loop locations, and 34 error locations. [2025-01-09 22:40:52,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:40:52,184 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;@11ea578d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:40:52,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2025-01-09 22:40:52,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 88 states have internal predecessors, (99), 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-01-09 22:40:52,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:40:52,192 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:52,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:40:52,194 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:40:52,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:40:52,199 INFO L85 PathProgramCache]: Analyzing trace with hash 893979442, now seen corresponding path program 1 times [2025-01-09 22:40:52,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:40:52,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139461637] [2025-01-09 22:40:52,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:52,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:40:52,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:40:52,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:40:52,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:52,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:40:52,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:40:52,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139461637] [2025-01-09 22:40:52,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139461637] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:40:52,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:40:52,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:40:52,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755149971] [2025-01-09 22:40:52,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:40:52,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:40:52,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:40:52,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:40:52,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:40:52,414 INFO L87 Difference]: Start difference. First operand has 92 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 88 states have internal predecessors, (99), 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.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:40:52,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:40:52,490 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2025-01-09 22:40:52,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:40:52,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-09 22:40:52,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:40:52,497 INFO L225 Difference]: With dead ends: 88 [2025-01-09 22:40:52,497 INFO L226 Difference]: Without dead ends: 85 [2025-01-09 22:40:52,499 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-01-09 22:40:52,502 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 3 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:40:52,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 147 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:40:52,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-01-09 22:40:52,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-01-09 22:40:52,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.7450980392156863) internal successors, (89), 81 states have internal predecessors, (89), 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-01-09 22:40:52,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2025-01-09 22:40:52,535 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 6 [2025-01-09 22:40:52,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:40:52,536 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2025-01-09 22:40:52,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:40:52,536 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2025-01-09 22:40:52,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:40:52,536 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:52,536 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:40:52,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:40:52,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:40:52,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:40:52,537 INFO L85 PathProgramCache]: Analyzing trace with hash 893979443, now seen corresponding path program 1 times [2025-01-09 22:40:52,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:40:52,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069362370] [2025-01-09 22:40:52,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:52,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:40:52,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:40:52,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:40:52,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:52,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:52,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:40:52,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:40:52,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069362370] [2025-01-09 22:40:52,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069362370] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:40:52,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:40:52,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:40:52,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340691134] [2025-01-09 22:40:52,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:40:52,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:40:52,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:40:52,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:40:52,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:40:52,675 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:40:52,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:40:52,724 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2025-01-09 22:40:52,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:40:52,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-09 22:40:52,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:40:52,725 INFO L225 Difference]: With dead ends: 82 [2025-01-09 22:40:52,725 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 22:40:52,725 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-01-09 22:40:52,726 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 3 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:40:52,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 148 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:40:52,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 22:40:52,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-01-09 22:40:52,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.6862745098039216) internal successors, (86), 78 states have internal predecessors, (86), 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-01-09 22:40:52,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2025-01-09 22:40:52,730 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 6 [2025-01-09 22:40:52,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:40:52,730 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2025-01-09 22:40:52,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:40:52,730 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2025-01-09 22:40:52,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 22:40:52,731 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:52,731 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:40:52,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:40:52,732 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:40:52,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:40:52,732 INFO L85 PathProgramCache]: Analyzing trace with hash -931409341, now seen corresponding path program 1 times [2025-01-09 22:40:52,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:40:52,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107202533] [2025-01-09 22:40:52,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:52,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:40:52,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:40:52,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:40:52,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:52,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:52,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:40:52,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:40:52,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107202533] [2025-01-09 22:40:52,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107202533] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:40:52,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:40:52,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:40:52,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563515533] [2025-01-09 22:40:52,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:40:52,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:40:52,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:40:52,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:40:52,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:40:52,824 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-09 22:40:52,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:40:52,837 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2025-01-09 22:40:52,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:40:52,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2025-01-09 22:40:52,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:40:52,840 INFO L225 Difference]: With dead ends: 93 [2025-01-09 22:40:52,840 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 22:40:52,840 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-01-09 22:40:52,841 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 171 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-01-09 22:40:52,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 171 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:40:52,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 22:40:52,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2025-01-09 22:40:52,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 79 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-01-09 22:40:52,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2025-01-09 22:40:52,852 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 14 [2025-01-09 22:40:52,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:40:52,852 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2025-01-09 22:40:52,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-09 22:40:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2025-01-09 22:40:52,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:40:52,853 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:52,853 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:40:52,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:40:52,853 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:40:52,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:40:52,853 INFO L85 PathProgramCache]: Analyzing trace with hash 469952261, now seen corresponding path program 1 times [2025-01-09 22:40:52,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:40:52,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55859998] [2025-01-09 22:40:52,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:52,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:40:52,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:40:52,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:40:52,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:52,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:53,028 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:40:53,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:40:53,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55859998] [2025-01-09 22:40:53,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55859998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:40:53,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:40:53,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:40:53,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188926002] [2025-01-09 22:40:53,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:40:53,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:40:53,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:40:53,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:40:53,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:40:53,030 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:40:53,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:40:53,180 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2025-01-09 22:40:53,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:40:53,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-01-09 22:40:53,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:40:53,182 INFO L225 Difference]: With dead ends: 82 [2025-01-09 22:40:53,182 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 22:40:53,182 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-01-09 22:40:53,183 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 7 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:40:53,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 280 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:40:53,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 22:40:53,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-01-09 22:40:53,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 78 states have internal predecessors, (86), 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-01-09 22:40:53,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2025-01-09 22:40:53,193 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 24 [2025-01-09 22:40:53,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:40:53,193 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2025-01-09 22:40:53,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:40:53,194 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2025-01-09 22:40:53,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:40:53,194 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:53,194 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:40:53,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:40:53,195 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:40:53,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:40:53,196 INFO L85 PathProgramCache]: Analyzing trace with hash 469952262, now seen corresponding path program 1 times [2025-01-09 22:40:53,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:40:53,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029000059] [2025-01-09 22:40:53,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:53,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:40:53,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:40:53,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:40:53,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:53,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:40:53,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:40:53,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029000059] [2025-01-09 22:40:53,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029000059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:40:53,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:40:53,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:40:53,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674692684] [2025-01-09 22:40:53,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:40:53,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:40:53,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:40:53,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:40:53,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:40:53,421 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-01-09 22:40:53,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:40:53,510 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2025-01-09 22:40:53,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:40:53,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 24 [2025-01-09 22:40:53,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:40:53,511 INFO L225 Difference]: With dead ends: 81 [2025-01-09 22:40:53,511 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 22:40:53,511 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-01-09 22:40:53,512 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 6 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:40:53,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 302 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:40:53,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 22:40:53,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-09 22:40:53,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 77 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-01-09 22:40:53,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2025-01-09 22:40:53,518 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 24 [2025-01-09 22:40:53,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:40:53,518 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2025-01-09 22:40:53,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-01-09 22:40:53,518 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2025-01-09 22:40:53,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:40:53,519 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:53,520 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:40:53,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:40:53,520 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:40:53,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:40:53,521 INFO L85 PathProgramCache]: Analyzing trace with hash 652556294, now seen corresponding path program 1 times [2025-01-09 22:40:53,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:40:53,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234742987] [2025-01-09 22:40:53,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:53,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:40:53,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:40:53,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:40:53,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:53,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:53,767 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:40:53,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:40:53,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234742987] [2025-01-09 22:40:53,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234742987] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:40:53,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982542300] [2025-01-09 22:40:53,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:53,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:40:53,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:40:53,770 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-01-09 22:40:53,772 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-01-09 22:40:53,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:40:53,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:40:53,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:53,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:53,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 22:40:53,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:40:53,895 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-01-09 22:40:53,927 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-01-09 22:40:53,954 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:40:53,954 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-01-09 22:40:53,968 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-01-09 22:40:53,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:40:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:40:54,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982542300] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:40:54,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:40:54,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 11 [2025-01-09 22:40:54,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657679432] [2025-01-09 22:40:54,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:40:54,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:40:54,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:40:54,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:40:54,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2025-01-09 22:40:54,136 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (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-01-09 22:40:54,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:40:54,327 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2025-01-09 22:40:54,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:40:54,328 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (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 26 [2025-01-09 22:40:54,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:40:54,329 INFO L225 Difference]: With dead ends: 86 [2025-01-09 22:40:54,329 INFO L226 Difference]: Without dead ends: 86 [2025-01-09 22:40:54,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 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-01-09 22:40:54,331 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 1 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:40:54,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 401 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 275 Invalid, 0 Unknown, 90 Unchecked, 0.2s Time] [2025-01-09 22:40:54,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-01-09 22:40:54,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-01-09 22:40:54,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.625) internal successors, (91), 81 states have internal predecessors, (91), 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-01-09 22:40:54,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2025-01-09 22:40:54,336 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 26 [2025-01-09 22:40:54,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:40:54,336 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2025-01-09 22:40:54,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (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-01-09 22:40:54,336 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2025-01-09 22:40:54,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:40:54,337 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:54,337 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:40:54,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 22:40:54,537 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-01-09 22:40:54,538 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:40:54,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:40:54,538 INFO L85 PathProgramCache]: Analyzing trace with hash 652556295, now seen corresponding path program 1 times [2025-01-09 22:40:54,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:40:54,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968399240] [2025-01-09 22:40:54,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:54,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:40:54,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:40:54,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:40:54,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:54,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:54,889 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:40:54,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:40:54,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968399240] [2025-01-09 22:40:54,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968399240] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:40:54,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078910907] [2025-01-09 22:40:54,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:54,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:40:54,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:40:54,891 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-01-09 22:40:54,893 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-01-09 22:40:54,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:40:54,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:40:54,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:54,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:54,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 22:40:54,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:40:54,999 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-01-09 22:40:55,004 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-01-09 22:40:55,136 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:40:55,137 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-01-09 22:40:55,156 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:40:55,156 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-01-09 22:40:55,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:40:55,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:40:55,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078910907] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:40:55,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:40:55,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2025-01-09 22:40:55,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956457958] [2025-01-09 22:40:55,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:40:55,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:40:55,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:40:55,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:40:55,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:40:55,298 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 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-01-09 22:40:55,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:40:55,501 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2025-01-09 22:40:55,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:40:55,501 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 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 26 [2025-01-09 22:40:55,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:40:55,502 INFO L225 Difference]: With dead ends: 86 [2025-01-09 22:40:55,502 INFO L226 Difference]: Without dead ends: 86 [2025-01-09 22:40:55,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 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-01-09 22:40:55,502 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:40:55,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:40:55,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-01-09 22:40:55,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-01-09 22:40:55,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 81 states have internal predecessors, (90), 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-01-09 22:40:55,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2025-01-09 22:40:55,505 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 26 [2025-01-09 22:40:55,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:40:55,506 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2025-01-09 22:40:55,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 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-01-09 22:40:55,506 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2025-01-09 22:40:55,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:40:55,506 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:55,506 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-01-09 22:40:55,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 22:40:55,707 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-01-09 22:40:55,707 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:40:55,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:40:55,708 INFO L85 PathProgramCache]: Analyzing trace with hash 41527880, now seen corresponding path program 1 times [2025-01-09 22:40:55,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:40:55,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604840296] [2025-01-09 22:40:55,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:55,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:40:55,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:40:55,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:40:55,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:55,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:55,785 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:40:55,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:40:55,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604840296] [2025-01-09 22:40:55,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604840296] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:40:55,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380350134] [2025-01-09 22:40:55,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:55,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:40:55,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:40:55,788 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-01-09 22:40:55,789 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-01-09 22:40:55,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:40:55,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:40:55,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:55,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:55,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 22:40:55,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:40:55,869 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-01-09 22:40:55,944 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:40:55,944 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-01-09 22:40:55,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:40:55,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:40:56,193 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:40:56,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380350134] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:40:56,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:40:56,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 20 [2025-01-09 22:40:56,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050752659] [2025-01-09 22:40:56,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:40:56,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 22:40:56,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:40:56,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 22:40:56,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:40:56,195 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 14 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 22:40:56,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:40:56,431 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2025-01-09 22:40:56,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:40:56,431 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 14 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 28 [2025-01-09 22:40:56,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:40:56,432 INFO L225 Difference]: With dead ends: 85 [2025-01-09 22:40:56,432 INFO L226 Difference]: Without dead ends: 85 [2025-01-09 22:40:56,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2025-01-09 22:40:56,432 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 52 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:40:56,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 764 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:40:56,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-01-09 22:40:56,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-01-09 22:40:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.5714285714285714) internal successors, (88), 80 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-01-09 22:40:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2025-01-09 22:40:56,438 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 28 [2025-01-09 22:40:56,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:40:56,439 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2025-01-09 22:40:56,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 14 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 22:40:56,439 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2025-01-09 22:40:56,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:40:56,440 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:56,440 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-01-09 22:40:56,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 22:40:56,641 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-01-09 22:40:56,641 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:40:56,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:40:56,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1282565973, now seen corresponding path program 1 times [2025-01-09 22:40:56,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:40:56,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362718723] [2025-01-09 22:40:56,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:56,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:40:56,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:40:56,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:40:56,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:56,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:56,788 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:40:56,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:40:56,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362718723] [2025-01-09 22:40:56,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362718723] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:40:56,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193440950] [2025-01-09 22:40:56,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:56,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:40:56,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:40:56,790 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-01-09 22:40:56,792 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-01-09 22:40:56,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:40:56,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:40:56,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:56,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:56,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 22:40:56,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:40:56,885 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-01-09 22:40:56,887 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-01-09 22:40:56,989 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-01-09 22:40:57,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:40:57,021 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-01-09 22:40:57,027 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:40:57,027 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-01-09 22:40:57,058 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-01-09 22:40:57,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:40:57,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193440950] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:40:57,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:40:57,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2025-01-09 22:40:57,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455678939] [2025-01-09 22:40:57,148 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:40:57,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 22:40:57,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:40:57,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 22:40:57,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2025-01-09 22:40:57,149 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 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-01-09 22:40:57,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:40:57,384 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2025-01-09 22:40:57,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:40:57,384 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 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 29 [2025-01-09 22:40:57,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:40:57,386 INFO L225 Difference]: With dead ends: 102 [2025-01-09 22:40:57,386 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 22:40:57,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 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-01-09 22:40:57,387 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 20 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:40:57,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 577 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 285 Invalid, 0 Unknown, 109 Unchecked, 0.2s Time] [2025-01-09 22:40:57,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 22:40:57,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 95. [2025-01-09 22:40:57,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 65 states have (on average 1.5692307692307692) internal successors, (102), 89 states have internal predecessors, (102), 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-01-09 22:40:57,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2025-01-09 22:40:57,398 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 29 [2025-01-09 22:40:57,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:40:57,398 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2025-01-09 22:40:57,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 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-01-09 22:40:57,398 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2025-01-09 22:40:57,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:40:57,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:57,399 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] [2025-01-09 22:40:57,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 22:40:57,599 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-01-09 22:40:57,600 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:40:57,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:40:57,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1104839467, now seen corresponding path program 1 times [2025-01-09 22:40:57,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:40:57,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142967405] [2025-01-09 22:40:57,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:57,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:40:57,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:40:57,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:40:57,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:57,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:57,687 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:40:57,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:40:57,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142967405] [2025-01-09 22:40:57,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142967405] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:40:57,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:40:57,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:40:57,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286658703] [2025-01-09 22:40:57,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:40:57,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:40:57,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:40:57,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:40:57,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:40:57,688 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-01-09 22:40:57,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:40:57,788 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2025-01-09 22:40:57,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:40:57,788 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 30 [2025-01-09 22:40:57,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:40:57,789 INFO L225 Difference]: With dead ends: 94 [2025-01-09 22:40:57,789 INFO L226 Difference]: Without dead ends: 94 [2025-01-09 22:40:57,789 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-01-09 22:40:57,789 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 7 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:40:57,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 316 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:40:57,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-09 22:40:57,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-01-09 22:40:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 65 states have (on average 1.5538461538461539) internal successors, (101), 88 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-01-09 22:40:57,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2025-01-09 22:40:57,796 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 30 [2025-01-09 22:40:57,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:40:57,796 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2025-01-09 22:40:57,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-01-09 22:40:57,796 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2025-01-09 22:40:57,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:40:57,797 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:57,797 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] [2025-01-09 22:40:57,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:40:57,797 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:40:57,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:40:57,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1104839468, now seen corresponding path program 1 times [2025-01-09 22:40:57,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:40:57,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284792749] [2025-01-09 22:40:57,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:57,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:40:57,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:40:57,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:40:57,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:57,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:57,926 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:40:57,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:40:57,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284792749] [2025-01-09 22:40:57,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284792749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:40:57,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:40:57,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:40:57,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695926870] [2025-01-09 22:40:57,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:40:57,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:40:57,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:40:57,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:40:57,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:40:57,927 INFO L87 Difference]: Start difference. First operand 94 states and 109 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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-01-09 22:40:58,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:40:58,019 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2025-01-09 22:40:58,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:40:58,020 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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 30 [2025-01-09 22:40:58,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:40:58,020 INFO L225 Difference]: With dead ends: 93 [2025-01-09 22:40:58,021 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 22:40:58,021 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-01-09 22:40:58,022 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 6 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 338 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-01-09 22:40:58,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 338 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:40:58,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 22:40:58,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-01-09 22:40:58,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 87 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-01-09 22:40:58,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2025-01-09 22:40:58,027 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 30 [2025-01-09 22:40:58,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:40:58,027 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2025-01-09 22:40:58,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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-01-09 22:40:58,027 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2025-01-09 22:40:58,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 22:40:58,028 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:58,028 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] [2025-01-09 22:40:58,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:40:58,028 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:40:58,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:40:58,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1430396804, now seen corresponding path program 1 times [2025-01-09 22:40:58,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:40:58,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073192724] [2025-01-09 22:40:58,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:58,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:40:58,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:40:58,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:40:58,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:58,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:58,136 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:40:58,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:40:58,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073192724] [2025-01-09 22:40:58,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073192724] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:40:58,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:40:58,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:40:58,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491760085] [2025-01-09 22:40:58,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:40:58,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:40:58,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:40:58,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:40:58,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:40:58,138 INFO L87 Difference]: Start difference. First operand 93 states and 108 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-01-09 22:40:58,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:40:58,299 INFO L93 Difference]: Finished difference Result 96 states and 114 transitions. [2025-01-09 22:40:58,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:40:58,300 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 35 [2025-01-09 22:40:58,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:40:58,300 INFO L225 Difference]: With dead ends: 96 [2025-01-09 22:40:58,300 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 22:40:58,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:40:58,301 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 42 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:40:58,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 391 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:40:58,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 22:40:58,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-01-09 22:40:58,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.5588235294117647) internal successors, (106), 90 states have internal predecessors, (106), 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-01-09 22:40:58,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 114 transitions. [2025-01-09 22:40:58,308 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 114 transitions. Word has length 35 [2025-01-09 22:40:58,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:40:58,308 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 114 transitions. [2025-01-09 22:40:58,308 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-01-09 22:40:58,308 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 114 transitions. [2025-01-09 22:40:58,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 22:40:58,311 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:58,311 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] [2025-01-09 22:40:58,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:40:58,311 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:40:58,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:40:58,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1430396803, now seen corresponding path program 1 times [2025-01-09 22:40:58,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:40:58,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056102574] [2025-01-09 22:40:58,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:58,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:40:58,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:40:58,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:40:58,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:58,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:58,520 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:40:58,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:40:58,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056102574] [2025-01-09 22:40:58,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056102574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:40:58,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:40:58,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:40:58,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628591949] [2025-01-09 22:40:58,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:40:58,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:40:58,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:40:58,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:40:58,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:40:58,522 INFO L87 Difference]: Start difference. First operand 96 states and 114 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-01-09 22:40:58,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:40:58,674 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2025-01-09 22:40:58,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:40:58,674 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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 35 [2025-01-09 22:40:58,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:40:58,675 INFO L225 Difference]: With dead ends: 96 [2025-01-09 22:40:58,675 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 22:40:58,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:40:58,675 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 39 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:40:58,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 440 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:40:58,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 22:40:58,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-01-09 22:40:58,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 90 states have internal predecessors, (104), 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-01-09 22:40:58,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2025-01-09 22:40:58,678 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 35 [2025-01-09 22:40:58,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:40:58,678 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2025-01-09 22:40:58,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-01-09 22:40:58,678 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2025-01-09 22:40:58,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:40:58,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:58,679 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] [2025-01-09 22:40:58,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:40:58,679 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:40:58,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:40:58,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1392087671, now seen corresponding path program 1 times [2025-01-09 22:40:58,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:40:58,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466041041] [2025-01-09 22:40:58,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:58,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:40:58,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:40:58,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:40:58,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:58,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:58,731 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:40:58,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:40:58,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466041041] [2025-01-09 22:40:58,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466041041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:40:58,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:40:58,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:40:58,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051635748] [2025-01-09 22:40:58,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:40:58,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:40:58,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:40:58,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:40:58,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:40:58,733 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-01-09 22:40:58,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:40:58,748 INFO L93 Difference]: Finished difference Result 125 states and 144 transitions. [2025-01-09 22:40:58,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:40:58,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 36 [2025-01-09 22:40:58,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:40:58,749 INFO L225 Difference]: With dead ends: 125 [2025-01-09 22:40:58,749 INFO L226 Difference]: Without dead ends: 125 [2025-01-09 22:40:58,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-01-09 22:40:58,750 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 87 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:40:58,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 154 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:40:58,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-01-09 22:40:58,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 98. [2025-01-09 22:40:58,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5142857142857142) internal successors, (106), 92 states have internal predecessors, (106), 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-01-09 22:40:58,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 114 transitions. [2025-01-09 22:40:58,755 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 114 transitions. Word has length 36 [2025-01-09 22:40:58,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:40:58,755 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 114 transitions. [2025-01-09 22:40:58,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-01-09 22:40:58,755 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 114 transitions. [2025-01-09 22:40:58,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 22:40:58,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:58,757 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-01-09 22:40:58,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:40:58,758 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:40:58,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:40:58,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1708619029, now seen corresponding path program 1 times [2025-01-09 22:40:58,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:40:58,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201051866] [2025-01-09 22:40:58,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:58,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:40:58,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 22:40:58,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 22:40:58,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:58,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:58,812 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:40:58,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:40:58,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201051866] [2025-01-09 22:40:58,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201051866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:40:58,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:40:58,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:40:58,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178006274] [2025-01-09 22:40:58,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:40:58,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:40:58,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:40:58,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:40:58,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:40:58,813 INFO L87 Difference]: Start difference. First operand 98 states and 114 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-01-09 22:40:58,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:40:58,829 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2025-01-09 22:40:58,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:40:58,830 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), 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 38 [2025-01-09 22:40:58,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:40:58,830 INFO L225 Difference]: With dead ends: 116 [2025-01-09 22:40:58,830 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 22:40:58,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-01-09 22:40:58,831 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 19 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:40:58,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 235 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:40:58,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 22:40:58,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2025-01-09 22:40:58,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 93 states have internal predecessors, (107), 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-01-09 22:40:58,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2025-01-09 22:40:58,834 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 38 [2025-01-09 22:40:58,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:40:58,834 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2025-01-09 22:40:58,834 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), 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-01-09 22:40:58,834 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2025-01-09 22:40:58,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:40:58,834 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:58,834 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, 1] [2025-01-09 22:40:58,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:40:58,835 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:40:58,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:40:58,835 INFO L85 PathProgramCache]: Analyzing trace with hash -2091402345, now seen corresponding path program 1 times [2025-01-09 22:40:58,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:40:58,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859090558] [2025-01-09 22:40:58,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:58,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:40:58,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:40:58,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:40:58,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:58,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:40:58,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:40:58,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859090558] [2025-01-09 22:40:58,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859090558] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:40:58,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166976485] [2025-01-09 22:40:58,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:58,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:40:58,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:40:58,889 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-01-09 22:40:58,890 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-01-09 22:40:58,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:40:58,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:40:58,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:58,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:58,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 22:40:59,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:40:59,020 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:40:59,020 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:40:59,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166976485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:40:59,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:40:59,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-09 22:40:59,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708316981] [2025-01-09 22:40:59,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:40:59,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:40:59,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:40:59,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:40:59,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:40:59,021 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-01-09 22:40:59,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:40:59,031 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2025-01-09 22:40:59,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:40:59,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 41 [2025-01-09 22:40:59,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:40:59,032 INFO L225 Difference]: With dead ends: 81 [2025-01-09 22:40:59,032 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 22:40:59,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 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-01-09 22:40:59,032 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:40:59,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 221 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:40:59,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 22:40:59,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-09 22:40:59,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 77 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-01-09 22:40:59,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2025-01-09 22:40:59,034 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 41 [2025-01-09 22:40:59,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:40:59,034 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2025-01-09 22:40:59,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-01-09 22:40:59,034 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2025-01-09 22:40:59,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 22:40:59,036 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:59,036 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-01-09 22:40:59,042 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-01-09 22:40:59,236 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,SelfDestructingSolverStorable15 [2025-01-09 22:40:59,237 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:40:59,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:40:59,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1781073760, now seen corresponding path program 1 times [2025-01-09 22:40:59,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:40:59,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966374430] [2025-01-09 22:40:59,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:59,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:40:59,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:40:59,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:40:59,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:59,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:59,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:40:59,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:40:59,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966374430] [2025-01-09 22:40:59,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966374430] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:40:59,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:40:59,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:40:59,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035525634] [2025-01-09 22:40:59,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:40:59,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:40:59,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:40:59,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:40:59,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:40:59,348 INFO L87 Difference]: Start difference. First operand 81 states and 88 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-01-09 22:40:59,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:40:59,487 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2025-01-09 22:40:59,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:40:59,488 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 40 [2025-01-09 22:40:59,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:40:59,488 INFO L225 Difference]: With dead ends: 84 [2025-01-09 22:40:59,488 INFO L226 Difference]: Without dead ends: 84 [2025-01-09 22:40:59,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:40:59,489 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 32 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:40:59,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 359 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:40:59,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-09 22:40:59,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-01-09 22:40:59,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 80 states have internal predecessors, (90), 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-01-09 22:40:59,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2025-01-09 22:40:59,491 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 40 [2025-01-09 22:40:59,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:40:59,491 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2025-01-09 22:40:59,491 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-01-09 22:40:59,491 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2025-01-09 22:40:59,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 22:40:59,491 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:59,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] [2025-01-09 22:40:59,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 22:40:59,491 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:40:59,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:40:59,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1781073759, now seen corresponding path program 1 times [2025-01-09 22:40:59,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:40:59,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168688532] [2025-01-09 22:40:59,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:59,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:40:59,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:40:59,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:40:59,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:59,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:40:59,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:40:59,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168688532] [2025-01-09 22:40:59,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168688532] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:40:59,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315249528] [2025-01-09 22:40:59,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:59,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:40:59,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:40:59,591 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-01-09 22:40:59,593 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-01-09 22:40:59,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:40:59,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:40:59,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:59,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:59,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 22:40:59,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:40:59,753 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:40:59,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:40:59,787 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:40:59,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315249528] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:40:59,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:40:59,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-01-09 22:40:59,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802935912] [2025-01-09 22:40:59,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:40:59,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:40:59,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:40:59,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:40:59,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:40:59,788 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:40:59,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:40:59,823 INFO L93 Difference]: Finished difference Result 136 states and 156 transitions. [2025-01-09 22:40:59,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:40:59,824 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2025-01-09 22:40:59,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:40:59,824 INFO L225 Difference]: With dead ends: 136 [2025-01-09 22:40:59,824 INFO L226 Difference]: Without dead ends: 136 [2025-01-09 22:40:59,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:40:59,825 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 154 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:40:59,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 253 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:40:59,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-09 22:40:59,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 98. [2025-01-09 22:40:59,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 94 states have internal predecessors, (113), 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-01-09 22:40:59,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 117 transitions. [2025-01-09 22:40:59,827 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 117 transitions. Word has length 40 [2025-01-09 22:40:59,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:40:59,827 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 117 transitions. [2025-01-09 22:40:59,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:40:59,827 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2025-01-09 22:40:59,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 22:40:59,827 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:59,828 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] [2025-01-09 22:40:59,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 22:41:00,028 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,SelfDestructingSolverStorable17 [2025-01-09 22:41:00,029 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:41:00,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:00,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1576875267, now seen corresponding path program 1 times [2025-01-09 22:41:00,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:00,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716518836] [2025-01-09 22:41:00,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:00,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:00,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:41:00,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:41:00,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:00,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:00,587 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:00,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:00,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716518836] [2025-01-09 22:41:00,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716518836] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:00,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775225551] [2025-01-09 22:41:00,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:00,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:00,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:00,591 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-01-09 22:41:00,592 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-01-09 22:41:00,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:41:00,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:41:00,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:00,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:00,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-01-09 22:41:00,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:00,729 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-01-09 22:41:00,794 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:41:00,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:41:00,840 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-01-09 22:41:00,872 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-01-09 22:41:00,925 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-01-09 22:41:00,956 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 0 case distinctions, treesize of input 35 treesize of output 26 [2025-01-09 22:41:01,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:01,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:01,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:01,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 29 [2025-01-09 22:41:01,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:01,176 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 42 treesize of output 16 [2025-01-09 22:41:01,180 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:41:01,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:41:01,199 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1391 (Array Int Int))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_1391) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_1391 .cse0))) v_ArrVal_1391)))) is different from false [2025-01-09 22:41:01,299 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2025-01-09 22:41:01,299 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 19 treesize of output 18 [2025-01-09 22:41:01,302 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1389 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1389) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2025-01-09 22:41:01,309 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1389 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1389) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) is different from false [2025-01-09 22:41:01,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:01,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2025-01-09 22:41:01,375 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 122 treesize of output 110 [2025-01-09 22:41:01,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2025-01-09 22:41:01,387 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 16 [2025-01-09 22:41:01,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775225551] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:01,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:41:01,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 35 [2025-01-09 22:41:01,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906840164] [2025-01-09 22:41:01,464 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:41:01,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-01-09 22:41:01,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:01,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-01-09 22:41:01,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1436, Unknown=25, NotChecked=234, Total=1806 [2025-01-09 22:41:01,465 INFO L87 Difference]: Start difference. First operand 98 states and 117 transitions. Second operand has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 32 states have internal predecessors, (65), 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-01-09 22:41:02,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:02,196 INFO L93 Difference]: Finished difference Result 146 states and 185 transitions. [2025-01-09 22:41:02,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 22:41:02,197 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 32 states have internal predecessors, (65), 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 42 [2025-01-09 22:41:02,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:02,197 INFO L225 Difference]: With dead ends: 146 [2025-01-09 22:41:02,197 INFO L226 Difference]: Without dead ends: 146 [2025-01-09 22:41:02,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=177, Invalid=2259, Unknown=26, NotChecked=294, Total=2756 [2025-01-09 22:41:02,199 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 76 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:02,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1314 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:41:02,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-01-09 22:41:02,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 107. [2025-01-09 22:41:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 84 states have (on average 1.5119047619047619) internal successors, (127), 103 states have internal predecessors, (127), 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-01-09 22:41:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2025-01-09 22:41:02,203 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 42 [2025-01-09 22:41:02,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:02,203 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2025-01-09 22:41:02,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 32 states have internal predecessors, (65), 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-01-09 22:41:02,203 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2025-01-09 22:41:02,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 22:41:02,203 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:02,204 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] [2025-01-09 22:41:02,213 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-01-09 22:41:02,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:02,404 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:41:02,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:02,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1576875268, now seen corresponding path program 1 times [2025-01-09 22:41:02,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:02,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433576750] [2025-01-09 22:41:02,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:02,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:02,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:41:02,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:41:02,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:02,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:03,249 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:03,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:03,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433576750] [2025-01-09 22:41:03,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433576750] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:03,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379957530] [2025-01-09 22:41:03,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:03,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:03,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:03,251 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-01-09 22:41:03,252 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-01-09 22:41:03,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:41:03,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:41:03,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:03,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:03,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-01-09 22:41:03,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:03,402 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-01-09 22:41:03,405 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-01-09 22:41:03,638 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:41:03,638 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-01-09 22:41:03,648 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:41:03,648 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-01-09 22:41:03,714 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-01-09 22:41:03,725 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-01-09 22:41:03,771 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-01-09 22:41:03,777 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 16 [2025-01-09 22:41:03,862 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-01-09 22:41:03,868 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-01-09 22:41:03,904 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 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-09 22:41:03,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-01-09 22:41:04,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:04,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:04,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 29 [2025-01-09 22:41:04,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:04,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-09 22:41:04,196 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 0 case distinctions, treesize of input 42 treesize of output 16 [2025-01-09 22:41:04,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 22:41:04,256 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:41:04,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:41:04,428 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_1546 (Array Int Int))) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_1546) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 9)) (not (= v_ArrVal_1546 (store .cse0 .cse1 (select v_ArrVal_1546 .cse1)))))) (forall ((v_ArrVal_1545 (Array Int Int))) (or (not (= v_ArrVal_1545 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 (select v_ArrVal_1545 .cse1)))) (forall ((v_ArrVal_1546 (Array Int Int))) (or (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_1546) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_1545) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= v_ArrVal_1546 (store .cse0 .cse1 (select v_ArrVal_1546 .cse1)))))))))) is different from false [2025-01-09 22:41:04,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:04,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2025-01-09 22:41:04,819 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 68 treesize of output 60 [2025-01-09 22:41:04,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2025-01-09 22:41:04,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2025-01-09 22:41:04,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:04,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2025-01-09 22:41:04,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:04,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2025-01-09 22:41:04,849 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:04,850 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:04,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2025-01-09 22:41:04,854 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:04,854 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:04,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-01-09 22:41:05,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379957530] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:05,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:41:05,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 41 [2025-01-09 22:41:05,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417683837] [2025-01-09 22:41:05,044 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:41:05,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-01-09 22:41:05,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:05,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-01-09 22:41:05,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2710, Unknown=3, NotChecked=104, Total=2970 [2025-01-09 22:41:05,046 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand has 42 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 37 states have internal predecessors, (74), 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-01-09 22:41:06,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:06,128 INFO L93 Difference]: Finished difference Result 155 states and 197 transitions. [2025-01-09 22:41:06,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 22:41:06,129 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 37 states have internal predecessors, (74), 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 42 [2025-01-09 22:41:06,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:06,129 INFO L225 Difference]: With dead ends: 155 [2025-01-09 22:41:06,130 INFO L226 Difference]: Without dead ends: 155 [2025-01-09 22:41:06,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=255, Invalid=4302, Unknown=3, NotChecked=132, Total=4692 [2025-01-09 22:41:06,131 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 108 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 1443 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:06,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1515 Invalid, 1453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1443 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 22:41:06,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-01-09 22:41:06,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 114. [2025-01-09 22:41:06,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.5054945054945055) internal successors, (137), 110 states have internal predecessors, (137), 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-01-09 22:41:06,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 141 transitions. [2025-01-09 22:41:06,134 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 141 transitions. Word has length 42 [2025-01-09 22:41:06,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:06,134 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 141 transitions. [2025-01-09 22:41:06,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 37 states have internal predecessors, (74), 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-01-09 22:41:06,134 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 141 transitions. [2025-01-09 22:41:06,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 22:41:06,134 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:06,134 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 22:41:06,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 22:41:06,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:06,335 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:41:06,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:06,336 INFO L85 PathProgramCache]: Analyzing trace with hash 462189839, now seen corresponding path program 2 times [2025-01-09 22:41:06,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:06,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318912077] [2025-01-09 22:41:06,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:41:06,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:06,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-01-09 22:41:06,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 44 statements. [2025-01-09 22:41:06,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:41:06,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:06,466 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:41:06,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:06,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318912077] [2025-01-09 22:41:06,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318912077] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:41:06,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:41:06,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:41:06,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59769973] [2025-01-09 22:41:06,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:41:06,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:41:06,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:06,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:41:06,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:41:06,468 INFO L87 Difference]: Start difference. First operand 114 states and 141 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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-01-09 22:41:06,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:06,610 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2025-01-09 22:41:06,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:41:06,611 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 44 [2025-01-09 22:41:06,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:06,611 INFO L225 Difference]: With dead ends: 114 [2025-01-09 22:41:06,611 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 22:41:06,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:41:06,612 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 29 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:06,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 416 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:41:06,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 22:41:06,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-01-09 22:41:06,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.4615384615384615) internal successors, (133), 110 states have internal predecessors, (133), 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-01-09 22:41:06,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2025-01-09 22:41:06,614 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 44 [2025-01-09 22:41:06,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:06,614 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2025-01-09 22:41:06,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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-01-09 22:41:06,618 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2025-01-09 22:41:06,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 22:41:06,618 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:06,618 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 22:41:06,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 22:41:06,618 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:41:06,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:06,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1666908370, now seen corresponding path program 2 times [2025-01-09 22:41:06,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:06,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071848403] [2025-01-09 22:41:06,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:41:06,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:06,630 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-01-09 22:41:06,638 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:41:06,639 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:41:06,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:06,686 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:41:06,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:06,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071848403] [2025-01-09 22:41:06,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071848403] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:06,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619040434] [2025-01-09 22:41:06,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:41:06,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:06,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:06,688 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-01-09 22:41:06,690 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-01-09 22:41:06,797 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-01-09 22:41:06,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:41:06,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:41:06,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:06,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 22:41:06,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:06,884 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:41:06,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:41:06,916 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:41:06,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619040434] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:41:06,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:41:06,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-01-09 22:41:06,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097693258] [2025-01-09 22:41:06,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:41:06,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:41:06,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:06,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:41:06,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:41:06,919 INFO L87 Difference]: Start difference. First operand 114 states and 137 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:41:06,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:06,938 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2025-01-09 22:41:06,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:41:06,939 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), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2025-01-09 22:41:06,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:06,939 INFO L225 Difference]: With dead ends: 101 [2025-01-09 22:41:06,939 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 22:41:06,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:41:06,941 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 44 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:06,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 246 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:41:06,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 22:41:06,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-01-09 22:41:06,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.3950617283950617) internal successors, (113), 97 states have internal predecessors, (113), 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-01-09 22:41:06,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2025-01-09 22:41:06,943 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 45 [2025-01-09 22:41:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:06,943 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2025-01-09 22:41:06,943 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), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:41:06,943 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2025-01-09 22:41:06,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 22:41:06,943 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:06,943 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 22:41:06,951 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-01-09 22:41:07,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:07,144 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:41:07,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:07,144 INFO L85 PathProgramCache]: Analyzing trace with hash -573370184, now seen corresponding path program 1 times [2025-01-09 22:41:07,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:07,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336667250] [2025-01-09 22:41:07,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:07,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:07,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:41:07,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:41:07,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:07,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:07,201 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 22:41:07,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:07,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336667250] [2025-01-09 22:41:07,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336667250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:41:07,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:41:07,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:41:07,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207046645] [2025-01-09 22:41:07,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:41:07,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:41:07,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:07,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:41:07,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:41:07,203 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-01-09 22:41:07,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:07,221 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2025-01-09 22:41:07,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:41:07,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 47 [2025-01-09 22:41:07,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:07,222 INFO L225 Difference]: With dead ends: 100 [2025-01-09 22:41:07,222 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 22:41:07,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-01-09 22:41:07,223 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 12 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:07,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 213 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:41:07,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 22:41:07,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2025-01-09 22:41:07,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 92 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-01-09 22:41:07,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2025-01-09 22:41:07,226 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 47 [2025-01-09 22:41:07,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:07,226 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2025-01-09 22:41:07,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-01-09 22:41:07,227 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2025-01-09 22:41:07,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 22:41:07,227 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:07,227 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 22:41:07,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 22:41:07,227 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:41:07,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:07,228 INFO L85 PathProgramCache]: Analyzing trace with hash 5638812, now seen corresponding path program 3 times [2025-01-09 22:41:07,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:07,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481105535] [2025-01-09 22:41:07,228 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:41:07,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:07,243 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 3 equivalence classes. [2025-01-09 22:41:07,265 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:41:07,266 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 22:41:07,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:07,328 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:41:07,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:07,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481105535] [2025-01-09 22:41:07,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481105535] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:07,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724778693] [2025-01-09 22:41:07,328 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:41:07,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:07,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:07,330 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-01-09 22:41:07,332 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-01-09 22:41:07,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 3 equivalence classes. [2025-01-09 22:41:08,072 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:41:08,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 22:41:08,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:08,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 22:41:08,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:08,125 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:41:08,125 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:41:08,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724778693] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:41:08,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:41:08,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-01-09 22:41:08,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631180426] [2025-01-09 22:41:08,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:41:08,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:41:08,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:08,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:41:08,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:41:08,126 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-01-09 22:41:08,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:08,143 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2025-01-09 22:41:08,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:41:08,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 49 [2025-01-09 22:41:08,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:08,144 INFO L225 Difference]: With dead ends: 94 [2025-01-09 22:41:08,144 INFO L226 Difference]: Without dead ends: 94 [2025-01-09 22:41:08,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:41:08,144 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 32 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:08,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 251 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:41:08,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-09 22:41:08,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2025-01-09 22:41:08,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 83 states have internal predecessors, (89), 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-01-09 22:41:08,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2025-01-09 22:41:08,146 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 49 [2025-01-09 22:41:08,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:08,146 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2025-01-09 22:41:08,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-01-09 22:41:08,147 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2025-01-09 22:41:08,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 22:41:08,147 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:08,147 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 22:41:08,159 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-01-09 22:41:08,347 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-01-09 22:41:08,348 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:41:08,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:08,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1406559529, now seen corresponding path program 1 times [2025-01-09 22:41:08,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:08,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319151792] [2025-01-09 22:41:08,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:08,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:08,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 22:41:08,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:41:08,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:08,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:41:08,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:08,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319151792] [2025-01-09 22:41:08,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319151792] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:08,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737171683] [2025-01-09 22:41:08,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:08,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:08,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:08,430 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-01-09 22:41:08,432 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-01-09 22:41:08,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 22:41:08,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:41:08,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:08,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:08,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 22:41:08,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:08,601 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:41:08,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:41:08,620 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:41:08,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737171683] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:41:08,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:41:08,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-01-09 22:41:08,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221004035] [2025-01-09 22:41:08,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:41:08,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:41:08,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:08,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:41:08,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:41:08,621 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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-01-09 22:41:08,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:08,643 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2025-01-09 22:41:08,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:41:08,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 50 [2025-01-09 22:41:08,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:08,644 INFO L225 Difference]: With dead ends: 91 [2025-01-09 22:41:08,644 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 22:41:08,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 96 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:41:08,644 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 52 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:08,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 281 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:41:08,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 22:41:08,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2025-01-09 22:41:08,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 83 states have internal predecessors, (88), 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-01-09 22:41:08,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2025-01-09 22:41:08,646 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 50 [2025-01-09 22:41:08,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:08,646 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2025-01-09 22:41:08,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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-01-09 22:41:08,646 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2025-01-09 22:41:08,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 22:41:08,646 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:08,646 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 22:41:08,654 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-01-09 22:41:08,847 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-01-09 22:41:08,847 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:41:08,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:08,847 INFO L85 PathProgramCache]: Analyzing trace with hash 988154370, now seen corresponding path program 1 times [2025-01-09 22:41:08,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:08,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224673879] [2025-01-09 22:41:08,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:08,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:08,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 22:41:08,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 22:41:08,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:08,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:09,748 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:09,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:09,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224673879] [2025-01-09 22:41:09,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224673879] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:09,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694296804] [2025-01-09 22:41:09,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:09,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:09,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:09,750 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-01-09 22:41:09,751 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-01-09 22:41:09,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 22:41:09,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 22:41:09,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:09,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:09,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-01-09 22:41:09,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:09,923 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-01-09 22:41:10,035 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:41:10,035 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-01-09 22:41:10,087 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-01-09 22:41:10,125 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:41:10,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2025-01-09 22:41:10,181 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-09 22:41:10,181 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 24 treesize of output 17 [2025-01-09 22:41:10,186 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 0 case distinctions, treesize of input 26 treesize of output 21 [2025-01-09 22:41:10,342 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-01-09 22:41:10,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 24 [2025-01-09 22:41:10,439 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 0 case distinctions, treesize of input 29 treesize of output 11 [2025-01-09 22:41:10,506 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 18 treesize of output 13 [2025-01-09 22:41:10,674 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:10,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:41:10,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:10,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-01-09 22:41:10,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:10,966 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 50 treesize of output 49 [2025-01-09 22:41:10,970 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 18 treesize of output 14 [2025-01-09 22:41:11,146 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2302 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2302) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2025-01-09 22:41:11,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:11,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-01-09 22:41:11,289 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 65 treesize of output 57 [2025-01-09 22:41:11,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:41:11,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:41:11,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:41:11,616 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-01-09 22:41:11,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694296804] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:41:11,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:41:11,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 28] total 76 [2025-01-09 22:41:11,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606876291] [2025-01-09 22:41:11,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:41:11,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2025-01-09 22:41:11,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:11,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2025-01-09 22:41:11,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=5182, Unknown=116, NotChecked=146, Total=5700 [2025-01-09 22:41:11,619 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 76 states, 75 states have (on average 1.7066666666666668) internal successors, (128), 68 states have internal predecessors, (128), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:41:13,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:13,029 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2025-01-09 22:41:13,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 22:41:13,029 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 1.7066666666666668) internal successors, (128), 68 states have internal predecessors, (128), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 53 [2025-01-09 22:41:13,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:13,030 INFO L225 Difference]: With dead ends: 87 [2025-01-09 22:41:13,030 INFO L226 Difference]: Without dead ends: 87 [2025-01-09 22:41:13,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1894 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=493, Invalid=8324, Unknown=117, NotChecked=186, Total=9120 [2025-01-09 22:41:13,031 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 164 mSDsluCounter, 2057 mSDsCounter, 0 mSdLazyCounter, 1768 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 2105 SdHoareTripleChecker+Invalid, 1838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:13,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 2105 Invalid, 1838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1768 Invalid, 0 Unknown, 57 Unchecked, 0.7s Time] [2025-01-09 22:41:13,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-01-09 22:41:13,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-01-09 22:41:13,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 68 states have (on average 1.2794117647058822) 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-01-09 22:41:13,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2025-01-09 22:41:13,039 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 53 [2025-01-09 22:41:13,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:13,039 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2025-01-09 22:41:13,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 75 states have (on average 1.7066666666666668) internal successors, (128), 68 states have internal predecessors, (128), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:41:13,039 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2025-01-09 22:41:13,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 22:41:13,040 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:13,040 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] [2025-01-09 22:41:13,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-09 22:41:13,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:13,241 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:41:13,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:13,241 INFO L85 PathProgramCache]: Analyzing trace with hash 459327679, now seen corresponding path program 1 times [2025-01-09 22:41:13,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:13,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77691305] [2025-01-09 22:41:13,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:13,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:13,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 22:41:13,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 22:41:13,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:13,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:14,000 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:41:14,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:14,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77691305] [2025-01-09 22:41:14,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77691305] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:14,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946985433] [2025-01-09 22:41:14,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:14,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:14,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:14,003 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-01-09 22:41:14,004 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-01-09 22:41:14,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 22:41:14,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 22:41:14,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:14,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:14,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-01-09 22:41:14,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:14,174 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-01-09 22:41:14,221 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:41:14,222 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-01-09 22:41:14,260 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-01-09 22:41:14,290 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:41:14,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2025-01-09 22:41:14,338 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-09 22:41:14,339 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 24 treesize of output 17 [2025-01-09 22:41:14,370 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 0 case distinctions, treesize of input 35 treesize of output 26 [2025-01-09 22:41:14,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:14,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:14,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:14,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 29 [2025-01-09 22:41:14,659 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:41:14,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 46 [2025-01-09 22:41:14,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:14,743 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 42 treesize of output 16 [2025-01-09 22:41:14,746 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:41:14,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:41:14,761 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2468 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2468) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2025-01-09 22:41:14,766 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2468 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_2468) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2025-01-09 22:41:14,769 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2468 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_2468) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2025-01-09 22:41:14,818 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2468 (Array Int Int)) (v_ArrVal_2467 (Array Int Int))) (or (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2467))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2468)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= v_ArrVal_2467 (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 (select v_ArrVal_2467 .cse1))))))) is different from false [2025-01-09 22:41:14,831 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| Int) (v_ArrVal_2468 (Array Int Int)) (v_ArrVal_2467 (Array Int Int))) (or (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| 8))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 (select v_ArrVal_2467 .cse0))) v_ArrVal_2467)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| |c_ULTIMATE.start_main_~s~0#1.offset|) (= 1 (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2467) (select v_ArrVal_2467 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2468) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2025-01-09 22:41:14,839 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| Int) (v_ArrVal_2468 (Array Int Int)) (v_ArrVal_2467 (Array Int Int))) (or (not (= v_ArrVal_2467 (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| 8))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0 (select v_ArrVal_2467 .cse0))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_2467) (select v_ArrVal_2467 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_2468) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) 1))) is different from false [2025-01-09 22:41:14,854 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| Int) (v_ArrVal_2468 (Array Int Int)) (v_ArrVal_2467 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| 8))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 (select v_ArrVal_2467 .cse0))) v_ArrVal_2467)) (= 1 (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2467) (select v_ArrVal_2467 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2468) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) is different from false [2025-01-09 22:41:14,862 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| Int) (v_ArrVal_2468 (Array Int Int)) (v_ArrVal_2467 (Array Int Int))) (or (not (= v_ArrVal_2467 (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| 8))) (store (store (select |c_#memory_$Pointer$#1.base| |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|) .cse0 (select v_ArrVal_2467 .cse0))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= 1 (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2467) (select v_ArrVal_2467 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2468) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) is different from false [2025-01-09 22:41:14,877 INFO L349 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2025-01-09 22:41:14,877 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 27 treesize of output 26 [2025-01-09 22:41:14,887 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| Int) (v_ArrVal_2468 (Array Int Int)) (v_ArrVal_2467 (Array Int Int)) (v_ArrVal_2465 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2465))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2467) (select v_ArrVal_2467 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2468) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= v_ArrVal_2467 (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| 8))) (store (store (select .cse0 |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|) .cse1 (select v_ArrVal_2467 .cse1))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2025-01-09 22:41:14,912 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| Int) (v_ArrVal_2468 (Array Int Int)) (v_ArrVal_2467 (Array Int Int)) (v_ArrVal_2465 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2465))) (or (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2467) (select v_ArrVal_2467 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_2468) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| 8))) (store (store (select .cse0 |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|) .cse1 (select v_ArrVal_2467 .cse1))) v_ArrVal_2467)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2025-01-09 22:41:14,923 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| Int) (v_ArrVal_2468 (Array Int Int)) (v_ArrVal_2467 (Array Int Int)) (v_ArrVal_2465 (Array Int Int)) (v_ArrVal_2464 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2464) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2465))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2467) (select v_ArrVal_2467 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_2468) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| 8))) (store (store (select .cse0 |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|) .cse1 (select v_ArrVal_2467 .cse1))) v_ArrVal_2467)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2025-01-09 22:41:14,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:14,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 58 [2025-01-09 22:41:14,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 221 [2025-01-09 22:41:14,951 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:14,951 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:14,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:14,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 119 [2025-01-09 22:41:14,963 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:14,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:14,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 95 [2025-01-09 22:41:14,974 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:14,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:14,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 67 [2025-01-09 22:41:14,992 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 11 treesize of output 9 [2025-01-09 22:41:15,061 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:15,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 113 [2025-01-09 22:41:15,084 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:15,085 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:15,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 61 [2025-01-09 22:41:15,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2025-01-09 22:41:15,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946985433] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:15,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:41:15,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 42 [2025-01-09 22:41:15,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376883456] [2025-01-09 22:41:15,153 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:41:15,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-01-09 22:41:15,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:15,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-01-09 22:41:15,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1833, Unknown=27, NotChecked=1056, Total=3080 [2025-01-09 22:41:15,155 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 43 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 39 states have internal predecessors, (92), 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-01-09 22:41:15,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:15,764 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2025-01-09 22:41:15,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 22:41:15,764 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 39 states have internal predecessors, (92), 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 56 [2025-01-09 22:41:15,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:15,764 INFO L225 Difference]: With dead ends: 91 [2025-01-09 22:41:15,764 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 22:41:15,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=257, Invalid=2952, Unknown=27, NotChecked=1320, Total=4556 [2025-01-09 22:41:15,766 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 95 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:15,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1175 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:41:15,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 22:41:15,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 22:41:15,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 87 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-01-09 22:41:15,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2025-01-09 22:41:15,768 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 56 [2025-01-09 22:41:15,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:15,768 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2025-01-09 22:41:15,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 39 states have internal predecessors, (92), 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-01-09 22:41:15,768 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2025-01-09 22:41:15,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 22:41:15,769 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:15,769 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] [2025-01-09 22:41:15,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-09 22:41:15,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:15,969 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:41:15,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:15,970 INFO L85 PathProgramCache]: Analyzing trace with hash 459327680, now seen corresponding path program 1 times [2025-01-09 22:41:15,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:15,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755159030] [2025-01-09 22:41:15,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:15,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:15,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 22:41:15,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 22:41:15,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:15,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:16,935 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:41:16,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:16,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755159030] [2025-01-09 22:41:16,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755159030] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:16,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810773513] [2025-01-09 22:41:16,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:16,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:16,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:16,938 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-01-09 22:41:16,938 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-01-09 22:41:17,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 22:41:17,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 22:41:17,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:17,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:17,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-01-09 22:41:17,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:17,108 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-01-09 22:41:17,110 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-01-09 22:41:17,306 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:41:17,306 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-01-09 22:41:17,314 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:41:17,315 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-01-09 22:41:17,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:41:17,396 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-01-09 22:41:17,454 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:41:17,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2025-01-09 22:41:17,459 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 31 treesize of output 16 [2025-01-09 22:41:17,584 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-09 22:41:17,585 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 33 treesize of output 24 [2025-01-09 22:41:17,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:17,601 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-01-09 22:41:17,653 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 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-09 22:41:17,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-01-09 22:41:17,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:17,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:17,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 29 [2025-01-09 22:41:17,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:17,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-09 22:41:18,037 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:41:18,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 58 [2025-01-09 22:41:18,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:18,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-01-09 22:41:18,146 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 0 case distinctions, treesize of input 42 treesize of output 16 [2025-01-09 22:41:18,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 22:41:18,209 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:41:18,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:41:18,648 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_2634 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2634))) (or (not (= v_ArrVal_2634 (store .cse0 .cse1 (select v_ArrVal_2634 .cse1)))) (< (+ 8 (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 0) (forall ((v_ArrVal_2635 (Array Int Int))) (or (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2636 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2635))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= (+ 12 (select (select (store .cse2 .cse3 v_ArrVal_2637) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_2636) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (not (= (store .cse5 .cse1 (select v_ArrVal_2635 .cse1)) v_ArrVal_2635))))))) (forall ((v_ArrVal_2634 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2634))) (or (not (= v_ArrVal_2634 (store .cse0 .cse1 (select v_ArrVal_2634 .cse1)))) (forall ((v_ArrVal_2635 (Array Int Int))) (or (forall ((v_ArrVal_2637 (Array Int Int))) (<= 0 (+ 8 (select (select (store .cse6 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2635) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2637) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (not (= (store .cse5 .cse1 (select v_ArrVal_2635 .cse1)) v_ArrVal_2635)))) (< (+ 8 (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 0)))))) is different from false [2025-01-09 22:41:18,700 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| Int)) (or (forall ((v_ArrVal_2634 (Array Int Int))) (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| 8))) (or (forall ((v_ArrVal_2635 (Array Int Int))) (or (not (= v_ArrVal_2635 (store .cse0 .cse1 (select v_ArrVal_2635 .cse1)))) (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2636 (Array Int Int))) (let ((.cse2 (select v_ArrVal_2635 |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2634) .cse2 v_ArrVal_2637) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2635) .cse2 v_ArrVal_2636) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) (< (+ (select v_ArrVal_2634 |c_ULTIMATE.start_main_~s~0#1.offset|) 8) 0) (not (= (store .cse3 .cse1 (select v_ArrVal_2634 .cse1)) v_ArrVal_2634))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2634 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| |c_ULTIMATE.start_main_~s~0#1.offset|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2634) (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2637) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 9)) (< (+ (select v_ArrVal_2634 |c_ULTIMATE.start_main_~s~0#1.offset|) 8) 0) (not (= (let ((.cse4 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| 8))) (store .cse3 .cse4 (select v_ArrVal_2634 .cse4))) v_ArrVal_2634)))))) is different from false [2025-01-09 22:41:18,728 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (and (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2634 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| Int)) (or (not (= v_ArrVal_2634 (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| 8))) (store .cse0 .cse1 (select v_ArrVal_2634 .cse1))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (< (+ (select v_ArrVal_2634 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 8) 0) (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_2634) (select .cse2 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_2637) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (forall ((v_ArrVal_2634 (Array Int Int))) (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| 8))) (or (not (= v_ArrVal_2634 (store .cse0 .cse3 (select v_ArrVal_2634 .cse3)))) (forall ((v_ArrVal_2635 (Array Int Int))) (or (not (= v_ArrVal_2635 (store .cse2 .cse3 (select v_ArrVal_2635 .cse3)))) (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2636 (Array Int Int))) (let ((.cse4 (select v_ArrVal_2635 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_2634) .cse4 v_ArrVal_2637) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 12) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_2635) .cse4 v_ArrVal_2636) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))))) (< (+ (select v_ArrVal_2634 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 8) 0)))))))) is different from false [2025-01-09 22:41:18,756 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2634 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| Int)) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2634) (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2637) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 9)) (not (= (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| 8))) (store .cse1 .cse2 (select v_ArrVal_2634 .cse2))) v_ArrVal_2634)) (< (+ (select v_ArrVal_2634 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 8) 0) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| Int)) (or (forall ((v_ArrVal_2634 (Array Int Int))) (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| 8))) (or (not (= (store .cse1 .cse3 (select v_ArrVal_2634 .cse3)) v_ArrVal_2634)) (< (+ (select v_ArrVal_2634 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 8) 0) (forall ((v_ArrVal_2635 (Array Int Int))) (or (not (= v_ArrVal_2635 (store .cse0 .cse3 (select v_ArrVal_2635 .cse3)))) (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2636 (Array Int Int))) (let ((.cse4 (select v_ArrVal_2635 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2634) .cse4 v_ArrVal_2637) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 12) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2635) .cse4 v_ArrVal_2636) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) is different from false [2025-01-09 22:41:18,788 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2634 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| 8))) (or (not (= v_ArrVal_2635 (store (store .cse0 .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 (select v_ArrVal_2635 .cse2)))) (not (= v_ArrVal_2634 (store (store .cse3 .cse1 (select v_ArrVal_2634 .cse1)) .cse2 (select v_ArrVal_2634 .cse2)))) (< (+ (select v_ArrVal_2634 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 8) 0) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (let ((.cse4 (select v_ArrVal_2635 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2634) .cse4 v_ArrVal_2637) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 11) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2635) .cse4 v_ArrVal_2636) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2634 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| Int)) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2634) (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2637) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 9)) (not (= v_ArrVal_2634 (let ((.cse5 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| 8))) (store (store .cse3 .cse1 (select v_ArrVal_2634 .cse1)) .cse5 (select v_ArrVal_2634 .cse5))))) (< (+ (select v_ArrVal_2634 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 8) 0) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) is different from false [2025-01-09 22:41:19,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:19,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 106 [2025-01-09 22:41:19,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:19,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 120 [2025-01-09 22:41:19,393 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 227 treesize of output 221 [2025-01-09 22:41:19,401 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 259 treesize of output 253 [2025-01-09 22:41:19,408 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:19,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:19,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 109 [2025-01-09 22:41:19,422 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:19,423 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:19,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:19,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 105 [2025-01-09 22:41:19,444 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:19,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:19,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 67 [2025-01-09 22:41:19,459 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:19,460 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:19,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:19,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 135 [2025-01-09 22:41:19,481 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:19,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:19,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 107 [2025-01-09 22:41:19,496 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:19,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:19,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 71 [2025-01-09 22:41:19,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-01-09 22:41:19,526 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 15 treesize of output 13 [2025-01-09 22:41:19,546 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:19,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-01-09 22:41:19,569 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:19,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-01-09 22:41:19,589 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:19,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-01-09 22:41:19,599 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:19,600 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:19,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2025-01-09 22:41:19,618 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:19,619 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:19,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2025-01-09 22:41:19,680 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 142 treesize of output 136 [2025-01-09 22:41:19,717 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:19,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 87 [2025-01-09 22:41:19,735 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:19,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 55 [2025-01-09 22:41:19,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2025-01-09 22:41:19,759 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:19,760 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:19,764 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 22:41:19,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 1 [2025-01-09 22:41:19,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810773513] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:19,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:41:19,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 48 [2025-01-09 22:41:19,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197543821] [2025-01-09 22:41:19,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:41:19,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-01-09 22:41:19,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:19,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-01-09 22:41:19,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=3712, Unknown=8, NotChecked=630, Total=4556 [2025-01-09 22:41:19,987 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 49 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 44 states have internal predecessors, (101), 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-01-09 22:41:21,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:21,269 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2025-01-09 22:41:21,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 22:41:21,269 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 44 states have internal predecessors, (101), 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 56 [2025-01-09 22:41:21,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:21,270 INFO L225 Difference]: With dead ends: 91 [2025-01-09 22:41:21,270 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 22:41:21,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=349, Invalid=5983, Unknown=8, NotChecked=800, Total=7140 [2025-01-09 22:41:21,271 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 93 mSDsluCounter, 1572 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 1624 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:21,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 1624 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 22:41:21,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 22:41:21,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2025-01-09 22:41:21,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 86 states have internal predecessors, (91), 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-01-09 22:41:21,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2025-01-09 22:41:21,273 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 56 [2025-01-09 22:41:21,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:21,274 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2025-01-09 22:41:21,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 44 states have internal predecessors, (101), 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-01-09 22:41:21,274 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2025-01-09 22:41:21,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 22:41:21,274 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:21,274 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2025-01-09 22:41:21,286 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-01-09 22:41:21,474 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,SelfDestructingSolverStorable27 [2025-01-09 22:41:21,475 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:41:21,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:21,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1155239380, now seen corresponding path program 1 times [2025-01-09 22:41:21,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:21,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108979427] [2025-01-09 22:41:21,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:21,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:21,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 22:41:21,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 22:41:21,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:21,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:21,578 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 22:41:21,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:21,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108979427] [2025-01-09 22:41:21,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108979427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:41:21,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:41:21,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:41:21,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102661880] [2025-01-09 22:41:21,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:41:21,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:41:21,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:21,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:41:21,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:41:21,579 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-01-09 22:41:21,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:21,719 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2025-01-09 22:41:21,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:41:21,719 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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 59 [2025-01-09 22:41:21,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:21,720 INFO L225 Difference]: With dead ends: 104 [2025-01-09 22:41:21,720 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 22:41:21,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:41:21,720 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 28 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:21,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 289 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:41:21,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 22:41:21,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 93. [2025-01-09 22:41:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 75 states have (on average 1.2933333333333332) internal successors, (97), 89 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-01-09 22:41:21,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2025-01-09 22:41:21,722 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 59 [2025-01-09 22:41:21,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:21,722 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2025-01-09 22:41:21,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-01-09 22:41:21,722 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2025-01-09 22:41:21,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 22:41:21,722 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:21,722 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2025-01-09 22:41:21,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 22:41:21,723 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:41:21,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:21,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1155239379, now seen corresponding path program 1 times [2025-01-09 22:41:21,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:21,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779804599] [2025-01-09 22:41:21,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:21,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:21,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 22:41:21,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 22:41:21,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:21,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 22:41:21,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:21,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779804599] [2025-01-09 22:41:21,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779804599] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:21,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78764100] [2025-01-09 22:41:21,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:21,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:21,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:21,783 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-01-09 22:41:21,784 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-01-09 22:41:21,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 22:41:21,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 22:41:21,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:21,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:21,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 22:41:21,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:21,996 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 22:41:21,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:41:22,013 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 22:41:22,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78764100] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:41:22,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:41:22,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 22:41:22,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435614686] [2025-01-09 22:41:22,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:41:22,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:41:22,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:22,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:41:22,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:41:22,014 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-01-09 22:41:22,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:22,040 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2025-01-09 22:41:22,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:41:22,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 59 [2025-01-09 22:41:22,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:22,041 INFO L225 Difference]: With dead ends: 93 [2025-01-09 22:41:22,041 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 22:41:22,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 113 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:41:22,041 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 30 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:22,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 377 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:41:22,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 22:41:22,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-01-09 22:41:22,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 75 states have (on average 1.28) internal successors, (96), 89 states have internal predecessors, (96), 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-01-09 22:41:22,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2025-01-09 22:41:22,044 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 59 [2025-01-09 22:41:22,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:22,044 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2025-01-09 22:41:22,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-01-09 22:41:22,044 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2025-01-09 22:41:22,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 22:41:22,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:22,044 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2025-01-09 22:41:22,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-01-09 22:41:22,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:22,245 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:41:22,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:22,245 INFO L85 PathProgramCache]: Analyzing trace with hash 59396967, now seen corresponding path program 2 times [2025-01-09 22:41:22,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:22,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937075166] [2025-01-09 22:41:22,245 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:41:22,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:22,258 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-01-09 22:41:22,265 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 22:41:22,265 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:41:22,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:22,318 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:41:22,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:22,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937075166] [2025-01-09 22:41:22,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937075166] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:22,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992832362] [2025-01-09 22:41:22,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:41:22,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:22,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:22,321 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-01-09 22:41:22,322 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-01-09 22:41:22,514 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-01-09 22:41:22,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 22:41:22,594 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:41:22,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:22,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 22:41:22,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:22,627 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:41:22,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:41:22,674 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:41:22,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992832362] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:41:22,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:41:22,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-01-09 22:41:22,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879483921] [2025-01-09 22:41:22,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:41:22,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:41:22,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:22,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:41:22,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:41:22,675 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:41:22,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:22,687 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2025-01-09 22:41:22,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:41:22,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 59 [2025-01-09 22:41:22,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:22,688 INFO L225 Difference]: With dead ends: 84 [2025-01-09 22:41:22,688 INFO L226 Difference]: Without dead ends: 84 [2025-01-09 22:41:22,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:41:22,688 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 14 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 164 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.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:22,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 164 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:41:22,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-09 22:41:22,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-01-09 22:41:22,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 80 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-01-09 22:41:22,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2025-01-09 22:41:22,690 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 59 [2025-01-09 22:41:22,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:22,690 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2025-01-09 22:41:22,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:41:22,690 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2025-01-09 22:41:22,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 22:41:22,691 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:22,691 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2025-01-09 22:41:22,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-01-09 22:41:22,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:22,891 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:41:22,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:22,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1251801467, now seen corresponding path program 1 times [2025-01-09 22:41:22,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:22,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027359389] [2025-01-09 22:41:22,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:22,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:22,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 22:41:22,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 22:41:22,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:22,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:23,065 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 22:41:23,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:23,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027359389] [2025-01-09 22:41:23,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027359389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:41:23,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:41:23,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:41:23,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177406679] [2025-01-09 22:41:23,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:41:23,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:41:23,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:23,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:41:23,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:41:23,066 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 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-01-09 22:41:23,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:23,182 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2025-01-09 22:41:23,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:41:23,182 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 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 62 [2025-01-09 22:41:23,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:23,182 INFO L225 Difference]: With dead ends: 82 [2025-01-09 22:41:23,182 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 22:41:23,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:41:23,183 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 18 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:23,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 307 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:41:23,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 22:41:23,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-01-09 22:41:23,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 78 states have internal predecessors, (82), 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-01-09 22:41:23,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2025-01-09 22:41:23,186 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 62 [2025-01-09 22:41:23,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:23,186 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2025-01-09 22:41:23,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 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-01-09 22:41:23,186 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2025-01-09 22:41:23,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 22:41:23,187 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:23,187 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2025-01-09 22:41:23,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 22:41:23,187 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:41:23,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:23,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1251826232, now seen corresponding path program 1 times [2025-01-09 22:41:23,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:23,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754235185] [2025-01-09 22:41:23,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:23,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:23,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 22:41:23,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 22:41:23,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:23,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:24,312 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:24,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:24,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754235185] [2025-01-09 22:41:24,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754235185] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:24,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162040149] [2025-01-09 22:41:24,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:24,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:24,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:24,315 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-01-09 22:41:24,316 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-01-09 22:41:24,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 22:41:24,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 22:41:24,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:24,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:24,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 112 conjuncts are in the unsatisfiable core [2025-01-09 22:41:24,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:24,541 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-01-09 22:41:24,684 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:41:24,684 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-01-09 22:41:24,750 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-01-09 22:41:24,798 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-01-09 22:41:24,872 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-01-09 22:41:24,879 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 0 case distinctions, treesize of input 26 treesize of output 21 [2025-01-09 22:41:25,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:25,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:25,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:25,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 24 [2025-01-09 22:41:25,289 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:41:25,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 68 [2025-01-09 22:41:25,301 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 25 treesize of output 17 [2025-01-09 22:41:25,303 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 34 treesize of output 21 [2025-01-09 22:41:25,546 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 0 case distinctions, treesize of input 46 treesize of output 24 [2025-01-09 22:41:25,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-01-09 22:41:25,706 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:25,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:41:25,919 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 76 treesize of output 56 [2025-01-09 22:41:25,928 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3258 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3258) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (forall ((v_ArrVal_3256 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3256) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1))) is different from false [2025-01-09 22:41:25,940 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3256 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3256) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_3258 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3258) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1))) is different from false [2025-01-09 22:41:25,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:25,948 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 38 treesize of output 37 [2025-01-09 22:41:25,950 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 13 treesize of output 11 [2025-01-09 22:41:26,085 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3255 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3255) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= v_ArrVal_3255 (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_3255 .cse0))))))) (= |c_ULTIMATE.start_main_~i~0#1| 0)) is different from false [2025-01-09 22:41:26,274 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3253 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3253) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2025-01-09 22:41:26,277 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3252 (Array Int Int)) (v_ArrVal_3253 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3252) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3253) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2025-01-09 22:41:26,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:26,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-01-09 22:41:26,284 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 65 treesize of output 57 [2025-01-09 22:41:26,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:41:26,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:41:26,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:41:26,618 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-01-09 22:41:26,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162040149] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:41:26,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:41:26,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32, 31] total 87 [2025-01-09 22:41:26,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579757597] [2025-01-09 22:41:26,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:41:26,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2025-01-09 22:41:26,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:26,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2025-01-09 22:41:26,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=6368, Unknown=26, NotChecked=820, Total=7482 [2025-01-09 22:41:26,621 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 87 states, 86 states have (on average 1.813953488372093) internal successors, (156), 79 states have internal predecessors, (156), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:41:28,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:28,528 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2025-01-09 22:41:28,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 22:41:28,528 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 86 states have (on average 1.813953488372093) internal successors, (156), 79 states have internal predecessors, (156), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 62 [2025-01-09 22:41:28,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:28,529 INFO L225 Difference]: With dead ends: 78 [2025-01-09 22:41:28,529 INFO L226 Difference]: Without dead ends: 78 [2025-01-09 22:41:28,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 111 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2311 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=545, Invalid=11004, Unknown=27, NotChecked=1080, Total=12656 [2025-01-09 22:41:28,531 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 101 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 1919 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 2180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 249 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:28,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1755 Invalid, 2180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1919 Invalid, 0 Unknown, 249 Unchecked, 0.8s Time] [2025-01-09 22:41:28,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-09 22:41:28,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-01-09 22:41:28,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.164179104477612) internal successors, (78), 74 states have internal predecessors, (78), 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-01-09 22:41:28,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2025-01-09 22:41:28,533 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 62 [2025-01-09 22:41:28,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:28,533 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2025-01-09 22:41:28,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 86 states have (on average 1.813953488372093) internal successors, (156), 79 states have internal predecessors, (156), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:41:28,534 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2025-01-09 22:41:28,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 22:41:28,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:28,534 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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-01-09 22:41:28,554 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-01-09 22:41:28,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:28,738 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:41:28,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:28,738 INFO L85 PathProgramCache]: Analyzing trace with hash -151111940, now seen corresponding path program 1 times [2025-01-09 22:41:28,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:28,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122524120] [2025-01-09 22:41:28,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:28,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:28,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 22:41:28,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 22:41:28,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:28,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:28,839 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 22:41:28,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:28,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122524120] [2025-01-09 22:41:28,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122524120] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:41:28,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:41:28,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 22:41:28,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281371591] [2025-01-09 22:41:28,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:41:28,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:41:28,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:28,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:41:28,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:41:28,841 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 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-01-09 22:41:28,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:28,909 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2025-01-09 22:41:28,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:41:28,910 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 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 63 [2025-01-09 22:41:28,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:28,910 INFO L225 Difference]: With dead ends: 78 [2025-01-09 22:41:28,910 INFO L226 Difference]: Without dead ends: 78 [2025-01-09 22:41:28,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:41:28,910 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 17 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:28,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 329 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:41:28,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-09 22:41:28,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-01-09 22:41:28,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 74 states have internal predecessors, (77), 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-01-09 22:41:28,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2025-01-09 22:41:28,912 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 63 [2025-01-09 22:41:28,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:28,912 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2025-01-09 22:41:28,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 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-01-09 22:41:28,912 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2025-01-09 22:41:28,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 22:41:28,912 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:28,912 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2025-01-09 22:41:28,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 22:41:28,913 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:41:28,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:28,913 INFO L85 PathProgramCache]: Analyzing trace with hash 783556697, now seen corresponding path program 1 times [2025-01-09 22:41:28,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:28,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528584710] [2025-01-09 22:41:28,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:28,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:28,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 22:41:28,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 22:41:28,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:28,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:29,758 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:41:29,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:29,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528584710] [2025-01-09 22:41:29,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528584710] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:29,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443810516] [2025-01-09 22:41:29,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:29,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:29,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:29,760 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-01-09 22:41:29,761 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-01-09 22:41:29,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 22:41:29,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 22:41:29,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:29,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:29,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 113 conjuncts are in the unsatisfiable core [2025-01-09 22:41:29,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:29,967 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-01-09 22:41:29,970 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-01-09 22:41:30,209 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:41:30,209 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-01-09 22:41:30,219 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:41:30,220 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-01-09 22:41:30,284 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-01-09 22:41:30,287 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-01-09 22:41:30,331 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-01-09 22:41:30,333 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-01-09 22:41:30,419 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-01-09 22:41:30,422 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-01-09 22:41:30,428 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 0 case distinctions, treesize of input 35 treesize of output 26 [2025-01-09 22:41:30,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-09 22:41:30,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:30,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:30,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 29 [2025-01-09 22:41:30,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:30,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-09 22:41:30,798 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:41:30,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 58 [2025-01-09 22:41:30,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:30,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-01-09 22:41:30,981 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 0 case distinctions, treesize of input 42 treesize of output 16 [2025-01-09 22:41:30,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 22:41:31,062 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 22:41:31,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:41:31,249 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3505 (Array Int Int)) (v_ArrVal_3506 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3505) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_3506 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2025-01-09 22:41:31,256 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3506 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_3505 (Array Int Int)) (v_ArrVal_3506 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3505) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2025-01-09 22:41:31,345 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((v_ArrVal_3505 (Array Int Int)) (v_ArrVal_3506 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3505) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_3506 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2025-01-09 22:41:31,374 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_3504 (Array Int Int))) (or (not (= v_ArrVal_3504 (store .cse0 .cse1 (select v_ArrVal_3504 .cse1)))) (forall ((v_ArrVal_3503 (Array Int Int))) (or (forall ((v_ArrVal_3505 (Array Int Int)) (v_ArrVal_3506 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3504))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3503) .cse2 v_ArrVal_3506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_3505) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (not (= v_ArrVal_3503 (store .cse4 .cse1 (select v_ArrVal_3503 .cse1)))))))) (forall ((v_ArrVal_3504 (Array Int Int))) (or (forall ((v_ArrVal_3503 (Array Int Int))) (or (not (= v_ArrVal_3503 (store .cse4 .cse1 (select v_ArrVal_3503 .cse1)))) (forall ((v_ArrVal_3506 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3503) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3504) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (not (= v_ArrVal_3504 (store .cse0 .cse1 (select v_ArrVal_3504 .cse1)))))))) is different from false [2025-01-09 22:41:31,446 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((v_ArrVal_3503 (Array Int Int)) (v_ArrVal_3506 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| Int)) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3503) (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 1)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (= (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| 8))) (store .cse1 .cse2 (select v_ArrVal_3503 .cse2))) v_ArrVal_3503)))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| Int)) (or (forall ((v_ArrVal_3504 (Array Int Int))) (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| 8))) (or (not (= (store .cse0 .cse3 (select v_ArrVal_3504 .cse3)) v_ArrVal_3504)) (forall ((v_ArrVal_3503 (Array Int Int))) (or (forall ((v_ArrVal_3505 (Array Int Int)) (v_ArrVal_3506 (Array Int Int))) (let ((.cse4 (select v_ArrVal_3504 |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3503) .cse4 v_ArrVal_3506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3504) .cse4 v_ArrVal_3505) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (not (= (store .cse1 .cse3 (select v_ArrVal_3503 .cse3)) v_ArrVal_3503))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2025-01-09 22:41:31,486 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (and (forall ((v_ArrVal_3503 (Array Int Int)) (v_ArrVal_3506 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| Int)) (or (not (= (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| 8))) (store .cse0 .cse1 (select v_ArrVal_3503 .cse1))) v_ArrVal_3503)) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_3503) (select .cse2 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_3506) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 1)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| Int)) (or (forall ((v_ArrVal_3504 (Array Int Int))) (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| 8))) (or (not (= (store .cse2 .cse3 (select v_ArrVal_3504 .cse3)) v_ArrVal_3504)) (forall ((v_ArrVal_3503 (Array Int Int))) (or (not (= (store .cse0 .cse3 (select v_ArrVal_3503 .cse3)) v_ArrVal_3503)) (forall ((v_ArrVal_3505 (Array Int Int)) (v_ArrVal_3506 (Array Int Int))) (let ((.cse4 (select v_ArrVal_3504 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_3503) .cse4 v_ArrVal_3506) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_3504) .cse4 v_ArrVal_3505) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))) is different from false [2025-01-09 22:41:31,507 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_3504 (Array Int Int))) (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| 8))) (or (forall ((v_ArrVal_3503 (Array Int Int))) (or (forall ((v_ArrVal_3505 (Array Int Int)) (v_ArrVal_3506 (Array Int Int))) (let ((.cse0 (select v_ArrVal_3504 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3503) .cse0 v_ArrVal_3506) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3504) .cse0 v_ArrVal_3505) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (not (= v_ArrVal_3503 (store .cse1 .cse2 (select v_ArrVal_3503 .cse2)))))) (not (= v_ArrVal_3504 (store .cse3 .cse2 (select v_ArrVal_3504 .cse2))))))))) (forall ((v_ArrVal_3503 (Array Int Int)) (v_ArrVal_3506 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3503) (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3506) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 1)) (not (= v_ArrVal_3503 (let ((.cse4 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| 8))) (store .cse1 .cse4 (select v_ArrVal_3503 .cse4))))))))) is different from false [2025-01-09 22:41:31,527 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (forall ((v_ArrVal_3503 (Array Int Int)) (v_ArrVal_3504 (Array Int Int)) (v_ArrVal_3505 (Array Int Int)) (v_ArrVal_3506 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| 8))) (or (not (= (store (store .cse0 .cse1 (select v_ArrVal_3503 .cse1)) .cse2 (select v_ArrVal_3503 .cse2)) v_ArrVal_3503)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= (store (store .cse3 .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 (select v_ArrVal_3504 .cse2)) v_ArrVal_3504)) (let ((.cse4 (select v_ArrVal_3504 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3503) .cse4 v_ArrVal_3506) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 3) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3504) .cse4 v_ArrVal_3505) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) (forall ((v_ArrVal_3503 (Array Int Int)) (v_ArrVal_3506 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| Int)) (or (not (= (let ((.cse5 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| 8))) (store (store .cse0 .cse1 (select v_ArrVal_3503 .cse1)) .cse5 (select v_ArrVal_3503 .cse5))) v_ArrVal_3503)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3503) (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3506) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 1)))))) is different from false [2025-01-09 22:41:31,553 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_3497 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3503 (Array Int Int)) (v_ArrVal_3504 (Array Int Int)) (v_ArrVal_3505 (Array Int Int)) (v_ArrVal_3506 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3498)) (.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3497)) (.cse4 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| 8))) (or (let ((.cse1 (select v_ArrVal_3504 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (< (+ (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3503) .cse1 v_ArrVal_3506) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 3) (select |c_#length| (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3504) .cse1 v_ArrVal_3505) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (not (= v_ArrVal_3504 (store (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 (select v_ArrVal_3504 .cse4)))) (not (= (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_ArrVal_3503 .cse3)) .cse4 (select v_ArrVal_3503 .cse4)) v_ArrVal_3503)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_3497 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3503 (Array Int Int)) (v_ArrVal_3506 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3497))) (or (< 0 (+ (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3503) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3506) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 1)) (not (= (let ((.cse6 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| 8))) (store (store (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_ArrVal_3503 .cse3)) .cse6 (select v_ArrVal_3503 .cse6))) v_ArrVal_3503)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) is different from false [2025-01-09 22:41:31,599 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_3497 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3503 (Array Int Int)) (v_ArrVal_3504 (Array Int Int)) (v_ArrVal_3505 (Array Int Int)) (v_ArrVal_3506 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| 8)) (.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3497)) (.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3498))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_ArrVal_3503 (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_3503 .cse1)) .cse2 (select v_ArrVal_3503 .cse2)))) (not (= v_ArrVal_3504 (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 (select v_ArrVal_3504 .cse2)))) (let ((.cse4 (select v_ArrVal_3504 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (< (+ 3 (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3503) .cse4 v_ArrVal_3506) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (select |c_#length| (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3504) .cse4 v_ArrVal_3505) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) (forall ((v_ArrVal_3497 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3503 (Array Int Int)) (v_ArrVal_3506 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3497))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< 0 (+ 1 (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3503) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_3506) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (not (= v_ArrVal_3503 (let ((.cse6 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| 8))) (store (store (select .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_3503 .cse1)) .cse6 (select v_ArrVal_3503 .cse6)))))))))) is different from false [2025-01-09 22:41:31,621 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3503 (Array Int Int)) (v_ArrVal_3506 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| Int)) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3495) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3497))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_ArrVal_3503 (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| 8))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_3503 .cse1)) .cse2 (select v_ArrVal_3503 .cse2))))) (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3503) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3496) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_3506) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 1))))) (forall ((v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3503 (Array Int Int)) (v_ArrVal_3504 (Array Int Int)) (v_ArrVal_3505 (Array Int Int)) (v_ArrVal_3506 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| Int)) (let ((.cse3 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3495) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3497)) (.cse6 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3496) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3498)) (.cse4 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| 8))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_73| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_ArrVal_3503 (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_3503 .cse1)) .cse4 (select v_ArrVal_3503 .cse4)))) (let ((.cse5 (select v_ArrVal_3504 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (< (+ (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3503) .cse5 v_ArrVal_3506) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 3) (select |c_#length| (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3504) .cse5 v_ArrVal_3505) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (not (= v_ArrVal_3504 (store (store (select .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 (select v_ArrVal_3504 .cse4))))))))) is different from false [2025-01-09 22:41:31,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:31,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 98 [2025-01-09 22:41:31,658 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 129 treesize of output 125 [2025-01-09 22:41:31,662 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:31,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:31,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 107 [2025-01-09 22:41:31,670 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:31,670 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:31,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:31,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 99 [2025-01-09 22:41:31,697 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:31,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:31,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 71 [2025-01-09 22:41:31,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:31,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 48 [2025-01-09 22:41:31,714 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 128 treesize of output 116 [2025-01-09 22:41:31,723 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 92 treesize of output 84 [2025-01-09 22:41:31,729 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 84 treesize of output 80 [2025-01-09 22:41:31,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2025-01-09 22:41:31,748 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:31,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-01-09 22:41:31,763 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:31,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-01-09 22:41:31,773 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:31,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-01-09 22:41:31,779 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:31,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-01-09 22:41:31,784 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:31,784 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:31,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2025-01-09 22:41:31,790 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:31,791 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:31,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2025-01-09 22:41:31,796 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 21 treesize of output 17 [2025-01-09 22:41:31,800 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:31,801 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:31,801 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:31,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:31,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 66 [2025-01-09 22:41:31,806 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:31,806 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:31,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:31,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 70 [2025-01-09 22:41:31,812 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:31,812 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:31,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-01-09 22:41:31,816 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:31,816 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:31,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-01-09 22:41:31,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-01-09 22:41:31,824 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:31,825 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:31,826 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 40 treesize of output 34 [2025-01-09 22:41:31,829 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:31,830 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 36 treesize of output 28 [2025-01-09 22:41:32,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443810516] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:32,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:41:32,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24] total 53 [2025-01-09 22:41:32,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388963735] [2025-01-09 22:41:32,000 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:41:32,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-01-09 22:41:32,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:32,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-01-09 22:41:32,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=3571, Unknown=39, NotChecked=1430, Total=5256 [2025-01-09 22:41:32,002 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 54 states, 53 states have (on average 2.150943396226415) internal successors, (114), 48 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:41:32,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:32,937 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2025-01-09 22:41:32,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 22:41:32,938 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.150943396226415) internal successors, (114), 48 states have internal predecessors, (114), 3 states have call successors, (3), 3 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 65 [2025-01-09 22:41:32,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:32,938 INFO L225 Difference]: With dead ends: 81 [2025-01-09 22:41:32,938 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 22:41:32,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=358, Invalid=5964, Unknown=42, NotChecked=1826, Total=8190 [2025-01-09 22:41:32,942 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 49 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:32,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 940 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:41:32,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 22:41:32,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-09 22:41:32,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 77 states have internal predecessors, (81), 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-01-09 22:41:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2025-01-09 22:41:32,946 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 65 [2025-01-09 22:41:32,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:32,947 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2025-01-09 22:41:32,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.150943396226415) internal successors, (114), 48 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:41:32,947 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2025-01-09 22:41:32,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 22:41:32,948 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:32,948 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2025-01-09 22:41:32,957 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-01-09 22:41:33,148 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,SelfDestructingSolverStorable34 [2025-01-09 22:41:33,148 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:41:33,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:33,149 INFO L85 PathProgramCache]: Analyzing trace with hash 783556696, now seen corresponding path program 1 times [2025-01-09 22:41:33,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:33,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957873699] [2025-01-09 22:41:33,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:33,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:33,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 22:41:33,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 22:41:33,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:33,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:33,279 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:41:33,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:33,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957873699] [2025-01-09 22:41:33,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957873699] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:33,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038715038] [2025-01-09 22:41:33,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:33,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:33,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:33,282 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-01-09 22:41:33,283 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-01-09 22:41:33,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 22:41:33,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 22:41:33,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:33,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:33,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-01-09 22:41:33,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:33,535 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-01-09 22:41:33,618 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:41:33,618 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-01-09 22:41:33,649 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-01-09 22:41:33,675 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-01-09 22:41:33,704 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-01-09 22:41:33,722 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 0 case distinctions, treesize of input 35 treesize of output 26 [2025-01-09 22:41:33,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:33,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:33,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:33,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 29 [2025-01-09 22:41:33,933 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:41:33,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 42 [2025-01-09 22:41:34,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:34,050 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 38 treesize of output 16 [2025-01-09 22:41:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 22:41:34,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:41:34,138 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3670 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3670) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2025-01-09 22:41:34,181 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3670 (Array Int Int)) (v_ArrVal_3669 (Array Int Int))) (or (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3669))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3670)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= v_ArrVal_3669 (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 (select v_ArrVal_3669 .cse1))))))) is different from false [2025-01-09 22:41:34,190 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3670 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_80| Int) (v_ArrVal_3669 (Array Int Int))) (or (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3669) (select v_ArrVal_3669 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3670) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_80| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_80| 8))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 (select v_ArrVal_3669 .cse0))) v_ArrVal_3669)))) is different from false [2025-01-09 22:41:34,196 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3670 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_80| Int) (v_ArrVal_3669 (Array Int Int))) (or (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_80| 8))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0 (select v_ArrVal_3669 .cse0))) v_ArrVal_3669)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_80| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_3669) (select v_ArrVal_3669 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_3670) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) 1))) is different from false [2025-01-09 22:41:34,203 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3670 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_80| Int) (v_ArrVal_3669 (Array Int Int))) (or (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3669) (select v_ArrVal_3669 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3670) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1) (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_80| 8))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 (select v_ArrVal_3669 .cse0))) v_ArrVal_3669)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_80| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2025-01-09 22:41:34,209 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3670 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_80| Int) (v_ArrVal_3669 (Array Int Int))) (or (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3669) (select v_ArrVal_3669 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3670) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1) (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_80| 8))) (store (store (select |c_#memory_$Pointer$#1.base| |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|) .cse0 (select v_ArrVal_3669 .cse0))) v_ArrVal_3669)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_80| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2025-01-09 22:41:34,217 INFO L349 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2025-01-09 22:41:34,217 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 27 treesize of output 26 [2025-01-09 22:41:34,230 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3670 (Array Int Int)) (v_ArrVal_3666 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_80| Int) (v_ArrVal_3669 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3666))) (or (not (= (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_80| 8))) (store (store (select .cse0 |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|) .cse1 (select v_ArrVal_3669 .cse1))) v_ArrVal_3669)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_80| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3669) (select v_ArrVal_3669 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3670) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2025-01-09 22:41:34,243 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3670 (Array Int Int)) (v_ArrVal_3666 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_80| Int) (v_ArrVal_3669 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3666))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_80| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3669) (select v_ArrVal_3669 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_3670) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_80| 8))) (store (store (select .cse0 |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|) .cse1 (select v_ArrVal_3669 .cse1))) v_ArrVal_3669))))) is different from false [2025-01-09 22:41:34,251 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3670 (Array Int Int)) (v_ArrVal_3665 (Array Int Int)) (v_ArrVal_3666 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_80| Int) (v_ArrVal_3669 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3665) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3666))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_80| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3669) (select v_ArrVal_3669 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_3670) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_80| 8))) (store (store (select .cse0 |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|) .cse1 (select v_ArrVal_3669 .cse1))) v_ArrVal_3669))))) is different from false [2025-01-09 22:41:34,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:34,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 58 [2025-01-09 22:41:34,265 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 113 treesize of output 109 [2025-01-09 22:41:34,269 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:34,269 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:34,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:34,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 119 [2025-01-09 22:41:34,279 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:34,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:34,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 81 [2025-01-09 22:41:34,286 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:34,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:34,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 67 [2025-01-09 22:41:34,294 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 11 treesize of output 9 [2025-01-09 22:41:34,341 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:34,342 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:34,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 123 [2025-01-09 22:41:34,363 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:34,363 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:34,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 73 [2025-01-09 22:41:34,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-01-09 22:41:34,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038715038] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:34,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:41:34,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 24] total 29 [2025-01-09 22:41:34,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934463839] [2025-01-09 22:41:34,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:41:34,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 22:41:34,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:34,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 22:41:34,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=989, Unknown=64, NotChecked=648, Total=1806 [2025-01-09 22:41:34,410 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 30 states, 29 states have (on average 3.413793103448276) internal successors, (99), 27 states have internal predecessors, (99), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:41:34,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:34,837 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2025-01-09 22:41:34,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 22:41:34,837 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.413793103448276) internal successors, (99), 27 states have internal predecessors, (99), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 65 [2025-01-09 22:41:34,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:34,837 INFO L225 Difference]: With dead ends: 83 [2025-01-09 22:41:34,838 INFO L226 Difference]: Without dead ends: 83 [2025-01-09 22:41:34,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=1463, Unknown=72, NotChecked=774, Total=2450 [2025-01-09 22:41:34,838 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 19 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:34,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 609 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:41:34,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-09 22:41:34,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2025-01-09 22:41:34,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 76 states have internal predecessors, (79), 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-01-09 22:41:34,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2025-01-09 22:41:34,841 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 65 [2025-01-09 22:41:34,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:34,841 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2025-01-09 22:41:34,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.413793103448276) internal successors, (99), 27 states have internal predecessors, (99), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:41:34,841 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2025-01-09 22:41:34,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 22:41:34,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:34,842 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2025-01-09 22:41:34,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-01-09 22:41:35,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:35,043 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:41:35,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:35,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1479534188, now seen corresponding path program 1 times [2025-01-09 22:41:35,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:35,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738875179] [2025-01-09 22:41:35,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:35,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:35,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 22:41:35,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 22:41:35,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:35,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:35,186 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 22:41:35,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:35,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738875179] [2025-01-09 22:41:35,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738875179] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:41:35,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:41:35,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:41:35,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174545417] [2025-01-09 22:41:35,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:41:35,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:41:35,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:35,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:41:35,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:41:35,187 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 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-01-09 22:41:35,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:35,278 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2025-01-09 22:41:35,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:41:35,279 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 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 66 [2025-01-09 22:41:35,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:35,279 INFO L225 Difference]: With dead ends: 79 [2025-01-09 22:41:35,279 INFO L226 Difference]: Without dead ends: 79 [2025-01-09 22:41:35,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:41:35,280 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 11 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:35,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 275 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:41:35,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-09 22:41:35,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-01-09 22:41:35,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.1) internal successors, (77), 75 states have internal predecessors, (77), 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-01-09 22:41:35,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2025-01-09 22:41:35,284 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 66 [2025-01-09 22:41:35,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:35,284 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2025-01-09 22:41:35,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 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-01-09 22:41:35,284 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2025-01-09 22:41:35,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 22:41:35,285 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:35,285 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2025-01-09 22:41:35,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 22:41:35,285 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:41:35,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:35,285 INFO L85 PathProgramCache]: Analyzing trace with hash -209656629, now seen corresponding path program 1 times [2025-01-09 22:41:35,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:35,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727789996] [2025-01-09 22:41:35,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:35,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:35,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 22:41:35,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 22:41:35,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:35,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:36,071 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:41:36,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:36,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727789996] [2025-01-09 22:41:36,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727789996] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:36,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050375627] [2025-01-09 22:41:36,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:36,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:36,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:36,073 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:41:36,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-01-09 22:41:36,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 22:41:36,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 22:41:36,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:36,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:36,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-01-09 22:41:36,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:36,298 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-01-09 22:41:36,322 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-01-09 22:41:36,375 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:41:36,375 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-01-09 22:41:36,433 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-01-09 22:41:36,471 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-01-09 22:41:36,535 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-01-09 22:41:36,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-01-09 22:41:36,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:36,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:36,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:36,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 29 [2025-01-09 22:41:36,882 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:41:36,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 46 [2025-01-09 22:41:37,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:37,010 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 36 treesize of output 16 [2025-01-09 22:41:37,051 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 22:41:37,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:41:38,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:38,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 58 [2025-01-09 22:41:38,004 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 227 treesize of output 221 [2025-01-09 22:41:38,007 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:38,008 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:38,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:38,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 119 [2025-01-09 22:41:38,019 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:38,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:38,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 95 [2025-01-09 22:41:38,027 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:38,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:38,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 67 [2025-01-09 22:41:38,037 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 13 treesize of output 11 [2025-01-09 22:41:38,113 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:38,114 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:38,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 156 [2025-01-09 22:41:38,149 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:38,150 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:38,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 76 [2025-01-09 22:41:38,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2025-01-09 22:41:38,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050375627] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:38,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:41:38,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24] total 43 [2025-01-09 22:41:38,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924675008] [2025-01-09 22:41:38,342 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:41:38,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-01-09 22:41:38,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:38,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-01-09 22:41:38,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=3527, Unknown=24, NotChecked=0, Total=3782 [2025-01-09 22:41:38,343 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 44 states, 43 states have (on average 2.441860465116279) internal successors, (105), 40 states have internal predecessors, (105), 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-01-09 22:41:39,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:39,250 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2025-01-09 22:41:39,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 22:41:39,251 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.441860465116279) internal successors, (105), 40 states have internal predecessors, (105), 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 68 [2025-01-09 22:41:39,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:39,251 INFO L225 Difference]: With dead ends: 80 [2025-01-09 22:41:39,251 INFO L226 Difference]: Without dead ends: 80 [2025-01-09 22:41:39,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=369, Invalid=5613, Unknown=24, NotChecked=0, Total=6006 [2025-01-09 22:41:39,252 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 63 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:39,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 620 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:41:39,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-09 22:41:39,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-01-09 22:41:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 76 states have internal predecessors, (78), 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-01-09 22:41:39,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2025-01-09 22:41:39,255 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 68 [2025-01-09 22:41:39,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:39,255 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2025-01-09 22:41:39,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.441860465116279) internal successors, (105), 40 states have internal predecessors, (105), 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-01-09 22:41:39,255 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2025-01-09 22:41:39,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 22:41:39,256 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:39,256 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2025-01-09 22:41:39,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-01-09 22:41:39,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-01-09 22:41:39,456 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:41:39,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:39,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1848463001, now seen corresponding path program 1 times [2025-01-09 22:41:39,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:39,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648270778] [2025-01-09 22:41:39,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:39,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:39,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 22:41:39,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 22:41:39,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:39,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:40,023 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:41:40,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:40,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648270778] [2025-01-09 22:41:40,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648270778] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:40,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295488181] [2025-01-09 22:41:40,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:40,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:40,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:40,025 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:41:40,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-01-09 22:41:40,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 22:41:40,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 22:41:40,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:40,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:40,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 86 conjuncts are in the unsatisfiable core [2025-01-09 22:41:40,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:40,263 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-01-09 22:41:40,307 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:41:40,307 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-01-09 22:41:40,351 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-01-09 22:41:40,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 16 treesize of output 11 [2025-01-09 22:41:40,429 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-01-09 22:41:40,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2025-01-09 22:41:40,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:40,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:40,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:40,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2025-01-09 22:41:40,657 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:41:40,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2025-01-09 22:41:40,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:40,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 27 [2025-01-09 22:41:40,818 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:41:40,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:41:40,943 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4069 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4069) |c_ULTIMATE.start_main_~s~0#1.base|) 0)))) is different from false [2025-01-09 22:41:40,984 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4069 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_4069) |c_ULTIMATE.start_main_~s~0#1.base|) 0)))) is different from false [2025-01-09 22:41:41,033 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4068 (Array Int Int)) (v_ArrVal_4069 (Array Int Int))) (or (not (= v_ArrVal_4068 (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_4068 .cse0))))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4068))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_4069)) |c_ULTIMATE.start_main_~s~0#1.base|) 0))))) is different from false [2025-01-09 22:41:41,042 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4068 (Array Int Int)) (v_ArrVal_4069 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_94| Int)) (or (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_94| 8))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 (select v_ArrVal_4068 .cse0))) v_ArrVal_4068)) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_4068) (select v_ArrVal_4068 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_4069) |c_ULTIMATE.start_main_~s~0#1.base|) 0) |c_ULTIMATE.start_main_~s~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_94| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2025-01-09 22:41:41,048 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4068 (Array Int Int)) (v_ArrVal_4069 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_94| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_4068) (select v_ArrVal_4068 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_4069) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_94| 8))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0 (select v_ArrVal_4068 .cse0))) v_ArrVal_4068)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_94| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) is different from false [2025-01-09 22:41:41,055 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4068 (Array Int Int)) (v_ArrVal_4069 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_94| Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4068) (select v_ArrVal_4068 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_4069) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_94| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= v_ArrVal_4068 (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_94| 8))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 (select v_ArrVal_4068 .cse0))))))) is different from false [2025-01-09 22:41:41,063 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4068 (Array Int Int)) (v_ArrVal_4069 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_94| Int)) (or (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_94| 8))) (store (store (select |c_#memory_$Pointer$#1.base| |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|) .cse0 (select v_ArrVal_4068 .cse0))) v_ArrVal_4068)) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4068) (select v_ArrVal_4068 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_4069) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_94| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2025-01-09 22:41:41,071 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4066 (Array Int Int)) (v_ArrVal_4068 (Array Int Int)) (v_ArrVal_4069 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_94| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4066))) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4068) (select v_ArrVal_4068 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_4069) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (not (= (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_94| 8))) (store (store (select .cse0 |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|) .cse1 (select v_ArrVal_4068 .cse1))) v_ArrVal_4068)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_94| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2025-01-09 22:41:41,087 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4066 (Array Int Int)) (v_ArrVal_4068 (Array Int Int)) (v_ArrVal_4069 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_94| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4066))) (or (not (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4068) (select v_ArrVal_4068 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_4069) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_94| 8))) (store (store (select .cse0 |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|) .cse1 (select v_ArrVal_4068 .cse1))) v_ArrVal_4068)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_94| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2025-01-09 22:41:41,096 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4065 (Array Int Int)) (v_ArrVal_4066 (Array Int Int)) (v_ArrVal_4068 (Array Int Int)) (v_ArrVal_4069 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_94| Int)) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4065) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4066))) (or (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4068) (select v_ArrVal_4068 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_4069) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_94| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_ArrVal_4068 (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_94| 8))) (store (store (select .cse0 |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|) .cse1 (select v_ArrVal_4068 .cse1)))))))) is different from false [2025-01-09 22:41:41,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:41,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 61 [2025-01-09 22:41:41,111 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 113 treesize of output 109 [2025-01-09 22:41:41,114 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:41,114 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:41,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:41,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 119 [2025-01-09 22:41:41,126 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:41,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:41,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 81 [2025-01-09 22:41:41,135 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:41,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:41,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 67 [2025-01-09 22:41:41,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2025-01-09 22:41:41,193 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:41,193 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:41,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:41,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 186 treesize of output 186 [2025-01-09 22:41:41,385 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:41,386 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:41,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:41,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 330 treesize of output 308 [2025-01-09 22:41:41,656 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:41,657 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:41,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:41,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 135 [2025-01-09 22:41:42,089 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 7 not checked. [2025-01-09 22:41:42,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295488181] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:41:42,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:41:42,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 28] total 70 [2025-01-09 22:41:42,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194416990] [2025-01-09 22:41:42,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:41:42,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2025-01-09 22:41:42,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:42,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2025-01-09 22:41:42,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3332, Unknown=40, NotChecked=1250, Total=4830 [2025-01-09 22:41:42,091 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand has 70 states, 70 states have (on average 2.2) internal successors, (154), 63 states have internal predecessors, (154), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 22:41:43,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:43,147 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2025-01-09 22:41:43,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 22:41:43,148 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 2.2) internal successors, (154), 63 states have internal predecessors, (154), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 69 [2025-01-09 22:41:43,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:43,148 INFO L225 Difference]: With dead ends: 78 [2025-01-09 22:41:43,148 INFO L226 Difference]: Without dead ends: 78 [2025-01-09 22:41:43,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 97 SyntacticMatches, 8 SemanticMatches, 80 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=310, Invalid=4802, Unknown=40, NotChecked=1490, Total=6642 [2025-01-09 22:41:43,149 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 134 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 2051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 655 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:43,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 924 Invalid, 2051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1389 Invalid, 0 Unknown, 655 Unchecked, 0.6s Time] [2025-01-09 22:41:43,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-09 22:41:43,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2025-01-09 22:41:43,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 68 states have (on average 1.088235294117647) internal successors, (74), 73 states have internal predecessors, (74), 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-01-09 22:41:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2025-01-09 22:41:43,151 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 69 [2025-01-09 22:41:43,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:43,151 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2025-01-09 22:41:43,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 2.2) internal successors, (154), 63 states have internal predecessors, (154), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 22:41:43,151 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2025-01-09 22:41:43,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 22:41:43,151 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:43,152 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2025-01-09 22:41:43,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-01-09 22:41:43,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-01-09 22:41:43,352 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:41:43,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:43,353 INFO L85 PathProgramCache]: Analyzing trace with hash -998054402, now seen corresponding path program 1 times [2025-01-09 22:41:43,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:43,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70157819] [2025-01-09 22:41:43,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:43,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:43,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 22:41:43,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 22:41:43,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:43,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:44,522 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:41:44,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:44,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70157819] [2025-01-09 22:41:44,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70157819] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:44,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610664273] [2025-01-09 22:41:44,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:44,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:44,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:44,524 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:41:44,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-01-09 22:41:44,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 22:41:44,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 22:41:44,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:44,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:44,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 129 conjuncts are in the unsatisfiable core [2025-01-09 22:41:44,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:44,768 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-01-09 22:41:44,851 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:41:44,851 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-01-09 22:41:44,898 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-01-09 22:41:44,935 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-01-09 22:41:45,003 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 18 [2025-01-09 22:41:45,007 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-01-09 22:41:45,047 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2025-01-09 22:41:45,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 41 [2025-01-09 22:41:45,052 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-01-09 22:41:45,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:45,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:45,214 INFO L349 Elim1Store]: treesize reduction 61, result has 10.3 percent of original size [2025-01-09 22:41:45,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 44 [2025-01-09 22:41:45,218 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-01-09 22:41:45,409 INFO L349 Elim1Store]: treesize reduction 116, result has 20.5 percent of original size [2025-01-09 22:41:45,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 106 treesize of output 84 [2025-01-09 22:41:45,422 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2025-01-09 22:41:45,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 31 [2025-01-09 22:41:45,844 INFO L349 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2025-01-09 22:41:45,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 77 treesize of output 50 [2025-01-09 22:41:45,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:45,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2025-01-09 22:41:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:41:45,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:42:08,745 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_4236 (Array Int Int))) (or (not (= v_ArrVal_4236 (store .cse0 .cse1 (select v_ArrVal_4236 .cse1)))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| Int) (v_ArrVal_4237 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_ArrVal_4239 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4236))) (let ((.cse5 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| 8)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4237))) (or (< (select (select (store .cse2 .cse3 v_ArrVal_4238) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (not (= (store (select .cse4 .cse3) .cse5 (select v_ArrVal_4239 .cse5)) v_ArrVal_4239)) (not (= v_ArrVal_4238 (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4238 .cse5)))) (= |c_ULTIMATE.start_main_~s~0#1.base| (select (let ((.cse6 (store .cse4 .cse3 v_ArrVal_4239))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) (forall ((v_ArrVal_4236 (Array Int Int))) (or (not (= v_ArrVal_4236 (store .cse0 .cse1 (select v_ArrVal_4236 .cse1)))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| Int) (v_ArrVal_4237 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_ArrVal_4239 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4236))) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4237)) (.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse10 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| 8)) (.cse7 (store .cse11 .cse9 v_ArrVal_4238))) (or (< (select (select .cse7 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (not (= (store (select .cse8 .cse9) .cse10 (select v_ArrVal_4239 .cse10)) v_ArrVal_4239)) (not (= v_ArrVal_4238 (store (select .cse11 .cse9) .cse10 (select v_ArrVal_4238 .cse10)))) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select .cse7 (select (select (store .cse8 .cse9 v_ArrVal_4239) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| (select (select .cse11 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))))))) is different from false [2025-01-09 22:42:08,898 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (or (not (= v_ArrVal_4236 (let ((.cse1 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse0 .cse1 (select v_ArrVal_4236 .cse1))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| Int) (v_ArrVal_4237 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_ArrVal_4239 (Array Int Int))) (let ((.cse4 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| 8)) (.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_4237)) (.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_4236)) (.cse3 (select v_ArrVal_4236 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| (select v_ArrVal_4237 |c_ULTIMATE.start_main_~s~0#1.offset|)) (not (= v_ArrVal_4239 (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4239 .cse4)))) (not (= (store (select .cse5 .cse3) .cse4 (select v_ArrVal_4238 .cse4)) v_ArrVal_4238)) (< (select (select (store .cse5 .cse3 v_ArrVal_4238) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (let ((.cse6 (store .cse2 .cse3 v_ArrVal_4239))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) 0) |c_ULTIMATE.start_main_~s~0#1.base|)))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| Int) (v_ArrVal_4237 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_ArrVal_4239 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_4237)) (.cse8 (select v_ArrVal_4236 |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse9 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| 8)) (.cse11 (store .cse10 .cse8 v_ArrVal_4238)) (.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_4236))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| (select v_ArrVal_4237 |c_ULTIMATE.start_main_~s~0#1.offset|)) (not (= v_ArrVal_4239 (store (select .cse7 .cse8) .cse9 (select v_ArrVal_4239 .cse9)))) (not (= (store (select .cse10 .cse8) .cse9 (select v_ArrVal_4238 .cse9)) v_ArrVal_4238)) (< (select (select .cse11 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select .cse11 (select (select (store .cse7 .cse8 v_ArrVal_4239) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 0)))))) (not (= v_ArrVal_4236 (let ((.cse12 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse0 .cse12 (select v_ArrVal_4236 .cse12))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2025-01-09 22:42:08,997 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (or (not (= v_ArrVal_4236 (let ((.cse1 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse0 .cse1 (select v_ArrVal_4236 .cse1))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| Int) (v_ArrVal_4237 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_ArrVal_4239 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_4237)) (.cse4 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (let ((.cse2 (store .cse5 .cse4 v_ArrVal_4238)) (.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_4236)) (.cse6 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| 8))) (or (< (select (select .cse2 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 0) (= (select (select .cse2 (select (select (store .cse3 .cse4 v_ArrVal_4239) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) 0) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (not (= (store (select .cse5 .cse4) .cse6 (select v_ArrVal_4238 .cse6)) v_ArrVal_4238)) (not (= v_ArrVal_4239 (store (select .cse3 .cse4) .cse6 (select v_ArrVal_4239 .cse6)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| (select v_ArrVal_4237 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (or (not (= v_ArrVal_4236 (let ((.cse7 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse0 .cse7 (select v_ArrVal_4236 .cse7))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| Int) (v_ArrVal_4237 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_ArrVal_4239 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_4237)) (.cse10 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| 8)) (.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_4236)) (.cse9 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (or (< (select (select (store .cse8 .cse9 v_ArrVal_4238) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 0) (not (= (store (select .cse8 .cse9) .cse10 (select v_ArrVal_4238 .cse10)) v_ArrVal_4238)) (not (= v_ArrVal_4239 (store (select .cse11 .cse9) .cse10 (select v_ArrVal_4239 .cse10)))) (= (select (let ((.cse12 (store .cse11 .cse9 v_ArrVal_4239))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) 0) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| (select v_ArrVal_4237 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))) is different from false [2025-01-09 22:42:09,090 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| Int) (v_ArrVal_4237 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_ArrVal_4239 (Array Int Int))) (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| 8)) (.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4237)) (.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4236)) (.cse1 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (not (= v_ArrVal_4238 (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4238 .cse2)))) (not (= v_ArrVal_4239 (store (select .cse3 .cse1) .cse2 (select v_ArrVal_4239 .cse2)))) (< (select (select (store .cse0 .cse1 v_ArrVal_4238) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (let ((.cse4 (store .cse3 .cse1 v_ArrVal_4239))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| (select v_ArrVal_4237 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (not (= v_ArrVal_4236 (let ((.cse6 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse5 .cse6 (select v_ArrVal_4236 .cse6))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_4236 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| Int) (v_ArrVal_4237 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_ArrVal_4239 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4237)) (.cse8 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4236)) (.cse9 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| 8)) (.cse10 (store .cse7 .cse8 v_ArrVal_4238))) (or (not (= v_ArrVal_4238 (store (select .cse7 .cse8) .cse9 (select v_ArrVal_4238 .cse9)))) (= (select (select .cse10 (select (select (store .cse11 .cse8 v_ArrVal_4239) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= v_ArrVal_4239 (store (select .cse11 .cse8) .cse9 (select v_ArrVal_4239 .cse9)))) (< (select (select .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| (select v_ArrVal_4237 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) (not (= v_ArrVal_4236 (let ((.cse12 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse5 .cse12 (select v_ArrVal_4236 .cse12))))))))))) is different from false [2025-01-09 22:42:09,162 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store (select |c_#memory_$Pointer$#1.base| |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|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (or (not (= (let ((.cse1 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse0 .cse1 (select v_ArrVal_4236 .cse1))) v_ArrVal_4236)) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| Int) (v_ArrVal_4237 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_ArrVal_4239 (Array Int Int))) (let ((.cse4 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| 8)) (.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4237)) (.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4236)) (.cse3 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (not (= v_ArrVal_4238 (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4238 .cse4)))) (not (= v_ArrVal_4239 (store (select .cse5 .cse3) .cse4 (select v_ArrVal_4239 .cse4)))) (< (select (select (store .cse2 .cse3 v_ArrVal_4238) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (let ((.cse6 (store .cse5 .cse3 v_ArrVal_4239))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| (select v_ArrVal_4237 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (or (not (= (let ((.cse7 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse0 .cse7 (select v_ArrVal_4236 .cse7))) v_ArrVal_4236)) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| Int) (v_ArrVal_4237 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_ArrVal_4239 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4237)) (.cse9 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4236)) (.cse10 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| 8)) (.cse11 (store .cse8 .cse9 v_ArrVal_4238))) (or (not (= v_ArrVal_4238 (store (select .cse8 .cse9) .cse10 (select v_ArrVal_4238 .cse10)))) (= (select (select .cse11 (select (select (store .cse12 .cse9 v_ArrVal_4239) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= v_ArrVal_4239 (store (select .cse12 .cse9) .cse10 (select v_ArrVal_4239 .cse10)))) (< (select (select .cse11 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| (select v_ArrVal_4237 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) is different from false [2025-01-09 22:42:09,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:42:09,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 79 [2025-01-09 22:42:09,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:42:09,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 521 treesize of output 539 [2025-01-09 22:42:09,316 INFO L349 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2025-01-09 22:42:09,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 147 treesize of output 178 [2025-01-09 22:42:09,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:42:09,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:42:09,525 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 98 treesize of output 100 [2025-01-09 22:42:09,641 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-01-09 22:42:09,717 INFO L349 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2025-01-09 22:42:09,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 154 treesize of output 187 [2025-01-09 22:42:09,905 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-01-09 22:42:09,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 48 [2025-01-09 22:42:09,963 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-01-09 22:42:09,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 114 [2025-01-09 22:42:10,050 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:42:10,050 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 20 treesize of output 20 [2025-01-09 22:42:10,121 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-01-09 22:42:10,145 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:42:10,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:42:10,151 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 1 case distinctions, treesize of input 44 treesize of output 35 [2025-01-09 22:42:11,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:42:11,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 708 treesize of output 716 [2025-01-09 22:42:14,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:42:14,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 44 [2025-01-09 22:42:14,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:42:14,382 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 76 treesize of output 80 [2025-01-09 22:42:14,417 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2025-01-09 22:42:14,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 72 [2025-01-09 22:42:14,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:42:14,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:42:14,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2025-01-09 22:42:14,531 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2025-01-09 22:42:14,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 71 [2025-01-09 22:42:14,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:42:14,569 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 31 treesize of output 35 [2025-01-09 22:42:14,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:42:14,608 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 57 treesize of output 59 [2025-01-09 22:42:18,825 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse75 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse75 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (let ((.cse74 (select .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse62 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse29 (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse2 (store .cse74 .cse62 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse1 (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| Int) (v_ArrVal_4236 (Array Int Int)) (v_ArrVal_4239 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (let ((.cse78 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse79 (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4236) .cse78 v_ArrVal_4239) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (not (= (let ((.cse76 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| 8))) (store v_ArrVal_4236 .cse76 (select v_ArrVal_4239 .cse76))) v_ArrVal_4239)) (not (= v_ArrVal_4236 (let ((.cse77 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse77 (select v_ArrVal_4236 .cse77))))) (= .cse78 .cse79) (= .cse79 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) (.cse8 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse30 (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 1)) (.cse26 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 1)) (.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse75 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (.cse67 (not .cse29)) (.cse68 (store .cse74 4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (or (and (or .cse0 .cse1) (or .cse0 (forall ((v_DerPreprocessor_24 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store .cse2 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|) v_DerPreprocessor_24) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_4236 (Array Int Int))) (or (not (= v_ArrVal_4236 (let ((.cse3 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse3 (select v_ArrVal_4236 .cse3))))) (forall ((v_prenex_70 (Array Int Int)) (v_prenex_69 Int)) (let ((.cse6 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse4 (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4236) .cse6 v_prenex_70) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (= .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= (let ((.cse5 (+ v_prenex_69 8))) (store v_ArrVal_4236 .cse5 (select v_prenex_70 .cse5))) v_prenex_70)) (= .cse4 .cse6))))))))) (or .cse8 (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (or (not (= v_ArrVal_4236 (let ((.cse9 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse9 (select v_ArrVal_4236 .cse9))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| Int) (v_ArrVal_4239 (Array Int Int))) (let ((.cse12 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse11 (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4236) .cse12 v_ArrVal_4239) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (not (= (let ((.cse10 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| 8))) (store v_ArrVal_4236 .cse10 (select v_ArrVal_4239 .cse10))) v_ArrVal_4239)) (= .cse11 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse12 .cse11))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_4236 (Array Int Int))) (or (not (= v_ArrVal_4236 (let ((.cse14 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse14 (select v_ArrVal_4236 .cse14))))) (forall ((v_prenex_70 (Array Int Int)) (v_prenex_69 Int)) (let ((.cse16 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse15 (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4236) .cse16 v_prenex_70) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse15) (= .cse16 .cse15) (not (= (let ((.cse17 (+ v_prenex_69 8))) (store v_ArrVal_4236 .cse17 (select v_prenex_70 .cse17))) v_prenex_70)))))))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (let ((.cse19 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (not (= v_ArrVal_4236 (let ((.cse18 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse18 (select v_ArrVal_4236 .cse18))))) (not (= .cse19 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_prenex_67 Int) (v_prenex_68 (Array Int Int))) (or (< v_prenex_67 0) (not (= (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4236) .cse19 v_prenex_68) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= v_prenex_68 (let ((.cse20 (+ v_prenex_67 8))) (store v_ArrVal_4236 .cse20 (select v_prenex_68 .cse20)))))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_4236 (Array Int Int))) (let ((.cse21 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (forall ((v_prenex_64 (Array Int Int))) (or (not (= (store v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select v_prenex_64 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) v_prenex_64)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4236) .cse21 v_prenex_64) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (not (= v_ArrVal_4236 (let ((.cse22 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse22 (select v_ArrVal_4236 .cse22))))) (not (= .cse21 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (let ((.cse24 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (not (= v_ArrVal_4236 (let ((.cse23 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse23 (select v_ArrVal_4236 .cse23))))) (not (= .cse24 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_prenex_63 Int) (v_prenex_55 (Array Int Int))) (or (not (= (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4236) .cse24 v_prenex_55) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (< v_prenex_63 0) (not (= (let ((.cse25 (+ v_prenex_63 8))) (store v_ArrVal_4236 .cse25 (select v_prenex_55 .cse25))) v_prenex_55))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (or (and (<= .cse26 0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_DerPreprocessor_23 Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store .cse2 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|) v_DerPreprocessor_23) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) .cse0) (or .cse0 (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (let ((.cse28 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (not (= v_ArrVal_4236 (let ((.cse27 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse27 (select v_ArrVal_4236 .cse27))))) (forall ((v_prenex_60 (Array Int Int))) (or (not (= (store v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select v_prenex_60 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) v_prenex_60)) (= .cse28 (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4236) .cse28 v_prenex_60) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (not (= .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) .cse29) (or .cse30 (forall ((v_prenex_67 Int) (v_ArrVal_4236 (Array Int Int)) (v_prenex_68 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (not (= v_ArrVal_4236 (let ((.cse31 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse31 (select v_ArrVal_4236 .cse31))))) (< v_prenex_67 0) (not (= (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4236) (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_prenex_68) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= v_prenex_68 (let ((.cse32 (+ v_prenex_67 8))) (store v_ArrVal_4236 .cse32 (select v_prenex_68 .cse32))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (let ((.cse34 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (not (= v_ArrVal_4236 (let ((.cse33 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse33 (select v_ArrVal_4236 .cse33))))) (forall ((v_prenex_64 (Array Int Int))) (or (not (= (store v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select v_prenex_64 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) v_prenex_64)) (not (= (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4236) .cse34 v_prenex_64) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (not (= .cse34 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_4236 (Array Int Int))) (let ((.cse35 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (forall ((v_prenex_68 (Array Int Int))) (or (not (= (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4236) .cse35 v_prenex_68) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_prenex_67 Int)) (or (< v_prenex_67 0) (< v_prenex_67 .cse26) (not (= v_prenex_68 (let ((.cse36 (+ v_prenex_67 8))) (store v_ArrVal_4236 .cse36 (select v_prenex_68 .cse36))))))))) (not (= v_ArrVal_4236 (let ((.cse37 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse37 (select v_ArrVal_4236 .cse37))))) (not (= .cse35 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (or (not (= v_ArrVal_4236 (let ((.cse38 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse38 (select v_ArrVal_4236 .cse38))))) (forall ((v_ArrVal_4239 (Array Int Int))) (let ((.cse39 (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4236)) (.cse40 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| 0) (not (= (let ((.cse41 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| 8))) (store (select .cse39 .cse40) .cse41 (select v_ArrVal_4239 .cse41))) v_ArrVal_4239)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (let ((.cse42 (store .cse39 .cse40 v_ArrVal_4239))) (select .cse42 (select (select .cse42 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (let ((.cse44 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (not (= v_ArrVal_4236 (let ((.cse43 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse43 (select v_ArrVal_4236 .cse43))))) (not (= .cse44 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_prenex_57 (Array Int Int))) (or (not (= (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4236) .cse44 v_prenex_57) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= (store v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select v_prenex_57 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) v_prenex_57))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (let ((.cse46 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (not (= v_ArrVal_4236 (let ((.cse45 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse45 (select v_ArrVal_4236 .cse45))))) (not (= .cse46 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_prenex_55 (Array Int Int))) (or (forall ((v_prenex_63 Int)) (or (< v_prenex_63 0) (not (= (let ((.cse47 (+ v_prenex_63 8))) (store v_ArrVal_4236 .cse47 (select v_prenex_55 .cse47))) v_prenex_55)) (< v_prenex_63 .cse26))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4236) .cse46 v_prenex_55) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (let ((.cse49 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_4239 (Array Int Int))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (let ((.cse48 (store (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4236) .cse49 v_ArrVal_4239))) (select .cse48 (select (select .cse48 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0)) (not (= v_ArrVal_4239 (store v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select v_ArrVal_4239 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) (not (= v_ArrVal_4236 (let ((.cse50 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse50 (select v_ArrVal_4236 .cse50))))) (not (= .cse49 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_DerPreprocessor_26 Int)) (let ((.cse51 (select (store .cse2 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|) v_DerPreprocessor_26) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (= .cse51 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse51 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) .cse1) (or .cse30 (forall ((v_ArrVal_4236 (Array Int Int)) (v_prenex_63 Int) (v_prenex_55 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (not (= v_ArrVal_4236 (let ((.cse52 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse52 (select v_ArrVal_4236 .cse52))))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4236) (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_prenex_55) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (< v_prenex_63 0) (not (= (let ((.cse53 (+ v_prenex_63 8))) (store v_ArrVal_4236 .cse53 (select v_prenex_55 .cse53))) v_prenex_55)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (or .cse8 (let ((.cse55 (store (select .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse62 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and .cse0 (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (let ((.cse54 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (forall ((v_prenex_64 (Array Int Int))) (or (not (= (store v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select v_prenex_64 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) v_prenex_64)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4236) .cse54 v_prenex_64) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (not (= v_ArrVal_4236 (let ((.cse56 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse55 .cse56 (select v_ArrVal_4236 .cse56))))) (not (= .cse54 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_4236 (Array Int Int)) (v_prenex_63 Int) (v_prenex_55 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (not (= v_ArrVal_4236 (let ((.cse57 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse55 .cse57 (select v_ArrVal_4236 .cse57))))) (not (= (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4236) (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_prenex_55) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (< v_prenex_63 0) (not (= (let ((.cse58 (+ v_prenex_63 8))) (store v_ArrVal_4236 .cse58 (select v_prenex_55 .cse58))) v_prenex_55)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) .cse30) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (let ((.cse60 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (not (= v_ArrVal_4236 (let ((.cse59 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse55 .cse59 (select v_ArrVal_4236 .cse59))))) (not (= .cse60 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_prenex_55 (Array Int Int))) (or (not (= (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4236) .cse60 v_prenex_55) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_prenex_63 Int)) (or (< v_prenex_63 0) (not (= (let ((.cse61 (+ v_prenex_63 8))) (store v_ArrVal_4236 .cse61 (select v_prenex_55 .cse61))) v_prenex_55)) (< v_prenex_63 .cse26)))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (or (not (= v_ArrVal_4236 (let ((.cse63 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse63 (select v_ArrVal_4236 .cse63))))) (forall ((v_prenex_70 (Array Int Int)) (v_prenex_69 Int)) (let ((.cse66 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse64 (+ v_prenex_69 8)) (.cse65 (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4236) .cse66 v_prenex_70) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (= .cse64 0) (= .cse65 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= (store v_ArrVal_4236 .cse64 (select v_prenex_70 .cse64)) v_prenex_70)) (= .cse65 .cse66))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or .cse67 (forall ((v_ArrVal_4236 (Array Int Int)) (v_prenex_58 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4236) (select v_ArrVal_4236 0) v_prenex_58) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (not (= (let ((.cse69 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse68 .cse69 (select v_ArrVal_4236 .cse69))) v_ArrVal_4236)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| 0) (not (= v_prenex_58 (store v_ArrVal_4236 0 (select v_prenex_58 0))))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (or (forall ((v_prenex_65 (Array Int Int))) (let ((.cse71 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse70 (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4236) .cse71 v_prenex_65) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (not (= (store v_ArrVal_4236 0 (select v_prenex_65 0)) v_prenex_65)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse70) (= .cse71 .cse70))))) (not (= v_ArrVal_4236 (let ((.cse72 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse72 (select v_ArrVal_4236 .cse72))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or .cse67 (forall ((v_ArrVal_4236 (Array Int Int)) (v_prenex_56 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4236) (select v_ArrVal_4236 0) v_prenex_56) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (not (= (store v_ArrVal_4236 0 (select v_prenex_56 0)) v_prenex_56)) (not (= (let ((.cse73 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse68 .cse73 (select v_ArrVal_4236 .cse73))) v_ArrVal_4236)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| 0)))))))))) is different from false [2025-01-09 22:42:19,982 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse75 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse75 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse74 (select .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse56 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse41 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse2 (store .cse74 .cse56 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse24 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse4 (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 1)) (.cse15 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse17 (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| Int) (v_ArrVal_4236 (Array Int Int)) (v_ArrVal_4239 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (let ((.cse78 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse77 (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4236) .cse78 v_ArrVal_4239) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (not (= (let ((.cse76 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| 8))) (store v_ArrVal_4236 .cse76 (select v_ArrVal_4239 .cse76))) v_ArrVal_4239)) (= .cse77 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse77 .cse78) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_ArrVal_4236 (let ((.cse79 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse79 (select v_ArrVal_4236 .cse79)))))))))) (.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse75 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (.cse60 (not .cse41)) (.cse58 (store .cse74 4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse16 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 1))) (and (or (forall ((v_prenex_67 Int) (v_ArrVal_4236 (Array Int Int)) (v_prenex_68 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (not (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4236) (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_prenex_68) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< v_prenex_67 0) (not (= v_prenex_68 (let ((.cse1 (+ v_prenex_67 8))) (store v_ArrVal_4236 .cse1 (select v_prenex_68 .cse1))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_ArrVal_4236 (let ((.cse3 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse3 (select v_ArrVal_4236 .cse3))))))) .cse4) (or (forall ((v_ArrVal_4236 (Array Int Int)) (v_prenex_63 Int) (v_prenex_55 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (< v_prenex_63 0) (not (= (let ((.cse5 (+ v_prenex_63 8))) (store v_ArrVal_4236 .cse5 (select v_prenex_55 .cse5))) v_prenex_55)) (not (= (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4236) (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_prenex_55) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_ArrVal_4236 (let ((.cse7 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse7 (select v_ArrVal_4236 .cse7))))))) .cse4) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (or (forall ((v_ArrVal_4239 (Array Int Int))) (let ((.cse9 (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4236)) (.cse10 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (= (select (let ((.cse8 (store .cse9 .cse10 v_ArrVal_4239))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| Int)) (or (not (= v_ArrVal_4239 (let ((.cse11 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| 8))) (store (select .cse9 .cse10) .cse11 (select v_ArrVal_4239 .cse11))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| 0)))))) (not (= v_ArrVal_4236 (let ((.cse12 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse12 (select v_ArrVal_4236 .cse12))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (let ((.cse13 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_prenex_64 (Array Int Int))) (or (not (= (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4236) .cse13 v_prenex_64) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= (store v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_prenex_64 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_prenex_64)))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse13)) (not (= v_ArrVal_4236 (let ((.cse14 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse14 (select v_ArrVal_4236 .cse14)))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (and (or (forall ((v_DerPreprocessor_24 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (not (= (select (store .cse2 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|) v_DerPreprocessor_24) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) .cse15) (or .cse15 (and (<= .cse16 0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_DerPreprocessor_23 Int)) (= (select (store .cse2 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|) v_DerPreprocessor_23) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) (or .cse17 .cse15) (or .cse15 (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (let ((.cse18 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse18)) (forall ((v_prenex_60 (Array Int Int))) (or (not (= (store v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_prenex_60 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_prenex_60)) (= .cse18 (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4236) .cse18 v_prenex_60) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (not (= v_ArrVal_4236 (let ((.cse19 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse19 (select v_ArrVal_4236 .cse19)))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (or (forall ((v_prenex_70 (Array Int Int)) (v_prenex_69 Int)) (let ((.cse21 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse20 (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4236) .cse21 v_prenex_70) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse20) (= .cse20 .cse21) (not (= (let ((.cse22 (+ v_prenex_69 8))) (store v_ArrVal_4236 .cse22 (select v_prenex_70 .cse22))) v_prenex_70)))))) (not (= v_ArrVal_4236 (let ((.cse23 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse23 (select v_ArrVal_4236 .cse23))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or .cse24 (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| Int) (v_ArrVal_4239 (Array Int Int))) (let ((.cse26 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse25 (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4236) .cse26 v_ArrVal_4239) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse25) (= .cse25 .cse26) (not (= (let ((.cse27 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_99| 8))) (store v_ArrVal_4236 .cse27 (select v_ArrVal_4239 .cse27))) v_ArrVal_4239)))))) (not (= v_ArrVal_4236 (let ((.cse28 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse28 (select v_ArrVal_4236 .cse28))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (let ((.cse29 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_prenex_67 Int) (v_prenex_68 (Array Int Int))) (or (not (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4236) .cse29 v_prenex_68) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< v_prenex_67 0) (not (= v_prenex_68 (let ((.cse30 (+ v_prenex_67 8))) (store v_ArrVal_4236 .cse30 (select v_prenex_68 .cse30))))))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse29)) (not (= v_ArrVal_4236 (let ((.cse31 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse31 (select v_ArrVal_4236 .cse31)))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (let ((.cse32 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_prenex_64 (Array Int Int))) (or (not (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4236) .cse32 v_prenex_64) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= (store v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_prenex_64 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_prenex_64)))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse32)) (not (= v_ArrVal_4236 (let ((.cse33 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse33 (select v_ArrVal_4236 .cse33)))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (let ((.cse34 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse34)) (forall ((v_prenex_63 Int) (v_prenex_55 (Array Int Int))) (or (not (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4236) .cse34 v_prenex_55) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< v_prenex_63 0) (not (= (let ((.cse35 (+ v_prenex_63 8))) (store v_ArrVal_4236 .cse35 (select v_prenex_55 .cse35))) v_prenex_55)))) (not (= v_ArrVal_4236 (let ((.cse36 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse36 (select v_ArrVal_4236 .cse36)))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (or (forall ((v_prenex_70 (Array Int Int)) (v_prenex_69 Int)) (let ((.cse38 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse37 (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4236) .cse38 v_prenex_70) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (= .cse37 .cse38) (not (= (let ((.cse39 (+ v_prenex_69 8))) (store v_ArrVal_4236 .cse39 (select v_prenex_70 .cse39))) v_prenex_70)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse37))))) (not (= v_ArrVal_4236 (let ((.cse40 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse40 (select v_ArrVal_4236 .cse40))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) .cse41) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (or (forall ((v_prenex_70 (Array Int Int)) (v_prenex_69 Int)) (let ((.cse44 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse43 (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4236) .cse44 v_prenex_70) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse42 (+ v_prenex_69 8))) (or (= .cse42 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse43) (= .cse43 .cse44) (not (= (store v_ArrVal_4236 .cse42 (select v_prenex_70 .cse42)) v_prenex_70)))))) (not (= v_ArrVal_4236 (let ((.cse45 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse45 (select v_ArrVal_4236 .cse45))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (let ((.cse46 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_prenex_57 (Array Int Int))) (or (not (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4236) .cse46 v_prenex_57) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= (store v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_prenex_57 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_prenex_57)))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse46)) (not (= v_ArrVal_4236 (let ((.cse47 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse47 (select v_ArrVal_4236 .cse47)))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or .cse24 (let ((.cse49 (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse56 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (or .cse4 (forall ((v_ArrVal_4236 (Array Int Int)) (v_prenex_63 Int) (v_prenex_55 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (not (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4236) (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_prenex_55) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< v_prenex_63 0) (not (= (let ((.cse48 (+ v_prenex_63 8))) (store v_ArrVal_4236 .cse48 (select v_prenex_55 .cse48))) v_prenex_55)) (not (= v_ArrVal_4236 (let ((.cse50 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse49 .cse50 (select v_ArrVal_4236 .cse50))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (let ((.cse51 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_prenex_55 (Array Int Int))) (or (not (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4236) .cse51 v_prenex_55) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (forall ((v_prenex_63 Int)) (or (< v_prenex_63 0) (< v_prenex_63 .cse16) (not (= (let ((.cse52 (+ v_prenex_63 8))) (store v_ArrVal_4236 .cse52 (select v_prenex_55 .cse52))) v_prenex_55)))))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse51)) (not (= v_ArrVal_4236 (let ((.cse53 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse49 .cse53 (select v_ArrVal_4236 .cse53)))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) .cse15 (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (let ((.cse54 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_prenex_64 (Array Int Int))) (or (not (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4236) .cse54 v_prenex_64) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= (store v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_prenex_64 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_prenex_64)))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse54)) (not (= v_ArrVal_4236 (let ((.cse55 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse49 .cse55 (select v_ArrVal_4236 .cse55)))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_DerPreprocessor_26 Int)) (let ((.cse57 (select (store .cse2 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|) v_DerPreprocessor_26) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (= .cse57 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse57)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or .cse17 (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (or (forall ((v_ArrVal_4236 (Array Int Int)) (v_prenex_56 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (not (= (store v_ArrVal_4236 0 (select v_prenex_56 0)) v_prenex_56)) (not (= (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4236) (select v_ArrVal_4236 0) v_prenex_56) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= (let ((.cse59 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse58 .cse59 (select v_ArrVal_4236 .cse59))) v_ArrVal_4236)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| 0))) .cse60) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (let ((.cse61 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse61)) (forall ((v_ArrVal_4239 (Array Int Int))) (or (not (= (store v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_4239 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_4239)) (= (select (let ((.cse62 (store (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4236) .cse61 v_ArrVal_4239))) (select .cse62 (select (select .cse62 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (not (= v_ArrVal_4236 (let ((.cse63 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse63 (select v_ArrVal_4236 .cse63)))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (let ((.cse64 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse64)) (forall ((v_prenex_68 (Array Int Int))) (or (not (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4236) .cse64 v_prenex_68) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (forall ((v_prenex_67 Int)) (or (< v_prenex_67 0) (< v_prenex_67 .cse16) (not (= v_prenex_68 (let ((.cse65 (+ v_prenex_67 8))) (store v_ArrVal_4236 .cse65 (select v_prenex_68 .cse65))))))))) (not (= v_ArrVal_4236 (let ((.cse66 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse66 (select v_ArrVal_4236 .cse66)))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (or (forall ((v_prenex_65 (Array Int Int))) (let ((.cse68 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse67 (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4236) .cse68 v_prenex_65) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (not (= (store v_ArrVal_4236 0 (select v_prenex_65 0)) v_prenex_65)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse67) (= .cse67 .cse68))))) (not (= v_ArrVal_4236 (let ((.cse69 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse69 (select v_ArrVal_4236 .cse69))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or .cse60 (forall ((v_ArrVal_4236 (Array Int Int)) (v_prenex_58 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (not (= (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4236) (select v_ArrVal_4236 0) v_prenex_58) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= (let ((.cse70 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse58 .cse70 (select v_ArrVal_4236 .cse70))) v_ArrVal_4236)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| 0) (not (= v_prenex_58 (store v_ArrVal_4236 0 (select v_prenex_58 0))))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| Int)) (or (forall ((v_ArrVal_4236 (Array Int Int))) (let ((.cse71 (select v_ArrVal_4236 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse71)) (forall ((v_prenex_55 (Array Int Int))) (or (not (= (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4236) .cse71 v_prenex_55) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (forall ((v_prenex_63 Int)) (or (< v_prenex_63 0) (< v_prenex_63 .cse16) (not (= (let ((.cse72 (+ v_prenex_63 8))) (store v_ArrVal_4236 .cse72 (select v_prenex_55 .cse72))) v_prenex_55)))))) (not (= v_ArrVal_4236 (let ((.cse73 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102|))) (store .cse2 .cse73 (select v_ArrVal_4236 .cse73)))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_102| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))))) is different from false