./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:22:47,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:22:48,002 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:22:48,009 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:22:48,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:22:48,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:22:48,030 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:22:48,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:22:48,030 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:22:48,030 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:22:48,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:22:48,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:22:48,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:22:48,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:22:48,031 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:22:48,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:22:48,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:22:48,031 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:22:48,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:22:48,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:22:48,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:22:48,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:22:48,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:22:48,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:22:48,032 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:22:48,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:22:48,032 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:22:48,032 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:22:48,032 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:22:48,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:22:48,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:22:48,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:22:48,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:22:48,033 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:22:48,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:22:48,033 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:22:48,033 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:22:48,033 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:22:48,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:22:48,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:22:48,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:22:48,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:22:48,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:22:48,034 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 [2025-03-03 13:22:48,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:22:48,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:22:48,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:22:48,269 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:22:48,269 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:22:48,270 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2025-03-03 13:22:49,380 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c648ab04/5e4e3bebe57b4a8eba596b0e1a4c7daa/FLAGbd7d19b6c [2025-03-03 13:22:49,648 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:22:49,650 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2025-03-03 13:22:49,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c648ab04/5e4e3bebe57b4a8eba596b0e1a4c7daa/FLAGbd7d19b6c [2025-03-03 13:22:49,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c648ab04/5e4e3bebe57b4a8eba596b0e1a4c7daa [2025-03-03 13:22:49,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:22:49,948 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:22:49,949 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:22:49,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:22:49,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:22:49,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:22:49" (1/1) ... [2025-03-03 13:22:49,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf098e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:49, skipping insertion in model container [2025-03-03 13:22:49,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:22:49" (1/1) ... [2025-03-03 13:22:49,973 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:22:50,193 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i[24672,24685] [2025-03-03 13:22:50,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:22:50,202 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:22:50,248 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i[24672,24685] [2025-03-03 13:22:50,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:22:50,269 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:22:50,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:50 WrapperNode [2025-03-03 13:22:50,270 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:22:50,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:22:50,271 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:22:50,271 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:22:50,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:50" (1/1) ... [2025-03-03 13:22:50,283 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:50" (1/1) ... [2025-03-03 13:22:50,296 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 142 [2025-03-03 13:22:50,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:22:50,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:22:50,297 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:22:50,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:22:50,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:50" (1/1) ... [2025-03-03 13:22:50,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:50" (1/1) ... [2025-03-03 13:22:50,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:50" (1/1) ... [2025-03-03 13:22:50,321 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 20, 9]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 14 writes are split as follows [0, 13, 1]. [2025-03-03 13:22:50,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:50" (1/1) ... [2025-03-03 13:22:50,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:50" (1/1) ... [2025-03-03 13:22:50,329 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:50" (1/1) ... [2025-03-03 13:22:50,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:50" (1/1) ... [2025-03-03 13:22:50,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:50" (1/1) ... [2025-03-03 13:22:50,332 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:50" (1/1) ... [2025-03-03 13:22:50,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:22:50,337 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:22:50,337 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:22:50,337 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:22:50,338 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:50" (1/1) ... [2025-03-03 13:22:50,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:22:50,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:22:50,360 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 13:22:50,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 13:22:50,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 13:22:50,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 13:22:50,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 13:22:50,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 13:22:50,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 13:22:50,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 13:22:50,377 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-03 13:22:50,377 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-03 13:22:50,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 13:22:50,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:22:50,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 13:22:50,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-03 13:22:50,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-03 13:22:50,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-03 13:22:50,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-03 13:22:50,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-03 13:22:50,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-03 13:22:50,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 13:22:50,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-03 13:22:50,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-03 13:22:50,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-03 13:22:50,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:22:50,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 13:22:50,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 13:22:50,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:22:50,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:22:50,465 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:22:50,467 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:22:50,614 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L629: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-03-03 13:22:50,630 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-03 13:22:50,645 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-03-03 13:22:50,645 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:22:50,655 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:22:50,656 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:22:50,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:22:50 BoogieIcfgContainer [2025-03-03 13:22:50,656 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:22:50,659 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:22:50,659 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:22:50,662 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:22:50,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:22:49" (1/3) ... [2025-03-03 13:22:50,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1923c63e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:22:50, skipping insertion in model container [2025-03-03 13:22:50,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:50" (2/3) ... [2025-03-03 13:22:50,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1923c63e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:22:50, skipping insertion in model container [2025-03-03 13:22:50,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:22:50" (3/3) ... [2025-03-03 13:22:50,664 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2025-03-03 13:22:50,677 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:22:50,678 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_append_unequal.i that has 2 procedures, 34 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-03 13:22:50,727 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:22:50,735 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1ed7131b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:22:50,735 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:22:50,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 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-03-03 13:22:50,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 13:22:50,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:50,743 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:50,744 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:50,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:50,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1837586127, now seen corresponding path program 1 times [2025-03-03 13:22:50,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:50,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729287909] [2025-03-03 13:22:50,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:50,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:50,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 13:22:50,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:22:50,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:50,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:51,088 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 13:22:51,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:51,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729287909] [2025-03-03 13:22:51,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729287909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:22:51,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:22:51,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:22:51,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108719423] [2025-03-03 13:22:51,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:22:51,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:22:51,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:51,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:22:51,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:22:51,109 INFO L87 Difference]: Start difference. First operand has 34 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-03-03 13:22:51,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:22:51,132 INFO L93 Difference]: Finished difference Result 64 states and 87 transitions. [2025-03-03 13:22:51,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:22:51,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) Word has length 23 [2025-03-03 13:22:51,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:22:51,138 INFO L225 Difference]: With dead ends: 64 [2025-03-03 13:22:51,139 INFO L226 Difference]: Without dead ends: 32 [2025-03-03 13:22:51,141 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-03-03 13:22:51,145 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 79 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-03-03 13:22:51,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 79 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:22:51,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-03 13:22:51,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2025-03-03 13:22:51,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 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-03-03 13:22:51,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-03-03 13:22:51,171 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 23 [2025-03-03 13:22:51,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:22:51,172 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-03-03 13:22:51,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-03-03 13:22:51,172 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2025-03-03 13:22:51,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 13:22:51,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:51,175 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:51,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:22:51,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:51,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:51,176 INFO L85 PathProgramCache]: Analyzing trace with hash -173661198, now seen corresponding path program 1 times [2025-03-03 13:22:51,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:51,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623015516] [2025-03-03 13:22:51,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:51,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:51,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 13:22:51,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 13:22:51,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:51,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:51,600 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 13:22:51,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:51,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623015516] [2025-03-03 13:22:51,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623015516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:22:51,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973382743] [2025-03-03 13:22:51,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:51,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:51,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:22:51,604 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:22:51,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 13:22:51,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 13:22:51,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 13:22:51,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:51,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:51,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 13:22:51,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:22:51,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-03 13:22:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:22:51,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:22:51,954 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 13:22:51,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973382743] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:22:51,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:22:51,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 13 [2025-03-03 13:22:51,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933132718] [2025-03-03 13:22:51,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:22:51,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 13:22:51,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:51,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 13:22:51,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:22:51,958 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 13:22:55,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 13:22:59,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 13:23:04,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 13:23:08,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 13:23:12,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 13:23:16,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 13:23:16,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:23:16,236 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2025-03-03 13:23:16,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 13:23:16,236 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2025-03-03 13:23:16,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:23:16,237 INFO L225 Difference]: With dead ends: 59 [2025-03-03 13:23:16,237 INFO L226 Difference]: Without dead ends: 36 [2025-03-03 13:23:16,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-03-03 13:23:16,238 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:23:16,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 242 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 24.2s Time] [2025-03-03 13:23:16,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-03 13:23:16,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-03 13:23:16,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 13:23:16,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-03-03 13:23:16,243 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 33 [2025-03-03 13:23:16,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:23:16,244 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-03-03 13:23:16,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 13:23:16,244 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-03-03 13:23:16,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 13:23:16,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:23:16,245 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:23:16,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 13:23:16,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:23:16,445 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:23:16,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:23:16,446 INFO L85 PathProgramCache]: Analyzing trace with hash -172737677, now seen corresponding path program 1 times [2025-03-03 13:23:16,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:23:16,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687037242] [2025-03-03 13:23:16,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:23:16,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:23:16,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 13:23:16,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 13:23:16,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:23:16,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:23:18,646 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:23:18,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:23:18,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687037242] [2025-03-03 13:23:18,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687037242] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:23:18,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051041327] [2025-03-03 13:23:18,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:23:18,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:23:18,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:23:18,648 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:23:18,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 13:23:18,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 13:23:19,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 13:23:19,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:23:19,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:23:19,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 126 conjuncts are in the unsatisfiable core [2025-03-03 13:23:19,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:23:19,164 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-03-03 13:23:19,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 13:23:19,401 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-03 13:23:19,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-03 13:23:19,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 13:23:19,538 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-03-03 13:23:19,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2025-03-03 13:23:19,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2025-03-03 13:23:19,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:23:19,681 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 30 treesize of output 27 [2025-03-03 13:23:19,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2025-03-03 13:23:19,908 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 104 treesize of output 56 [2025-03-03 13:23:19,916 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 9 treesize of output 7 [2025-03-03 13:23:19,923 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 11 treesize of output 3 [2025-03-03 13:23:19,927 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 15 treesize of output 7 [2025-03-03 13:23:20,120 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-03 13:23:20,121 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 20 treesize of output 23 [2025-03-03 13:23:20,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:23:20,144 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 112 treesize of output 65 [2025-03-03 13:23:20,151 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 9 treesize of output 7 [2025-03-03 13:23:20,166 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-03 13:23:20,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-03 13:23:20,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2025-03-03 13:23:20,343 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 84 treesize of output 52 [2025-03-03 13:23:20,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:23:20,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:23:20,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2025-03-03 13:23:20,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2025-03-03 13:23:20,422 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 19 treesize of output 11 [2025-03-03 13:23:20,504 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:23:20,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:23:20,579 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_454 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2) v_ArrVal_454) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_451))) (or (not (= v_ArrVal_452 (store (select .cse0 .cse1) .cse2 (select v_ArrVal_452 .cse2)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 .cse1 v_ArrVal_452) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2025-03-03 13:23:20,590 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_454 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2) v_ArrVal_454) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_451))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 .cse1 v_ArrVal_452) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= v_ArrVal_452 (store (select .cse0 .cse1) .cse2 (select v_ArrVal_452 .cse2)))))))) is different from false [2025-03-03 13:23:20,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051041327] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:23:20,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:23:20,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 43 [2025-03-03 13:23:20,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063262595] [2025-03-03 13:23:20,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:23:20,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-03 13:23:20,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:23:20,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-03 13:23:20,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1939, Unknown=3, NotChecked=178, Total=2256 [2025-03-03 13:23:20,734 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 43 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 34 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:23:22,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:23:22,257 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2025-03-03 13:23:22,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 13:23:22,258 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 34 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 33 [2025-03-03 13:23:22,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:23:22,258 INFO L225 Difference]: With dead ends: 42 [2025-03-03 13:23:22,258 INFO L226 Difference]: Without dead ends: 40 [2025-03-03 13:23:22,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=281, Invalid=3756, Unknown=3, NotChecked=250, Total=4290 [2025-03-03 13:23:22,265 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 30 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 13:23:22,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 385 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 861 Invalid, 1 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 13:23:22,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-03 13:23:22,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-03-03 13:23:22,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 13:23:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-03-03 13:23:22,274 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 33 [2025-03-03 13:23:22,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:23:22,275 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-03-03 13:23:22,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 34 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:23:22,275 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-03-03 13:23:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 13:23:22,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:23:22,275 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:23:22,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 13:23:22,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-03 13:23:22,476 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:23:22,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:23:22,476 INFO L85 PathProgramCache]: Analyzing trace with hash -654902940, now seen corresponding path program 1 times [2025-03-03 13:23:22,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:23:22,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122939266] [2025-03-03 13:23:22,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:23:22,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:23:22,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 13:23:22,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:23:22,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:23:22,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:23:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:23:24,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:23:24,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122939266] [2025-03-03 13:23:24,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122939266] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:23:24,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663298776] [2025-03-03 13:23:24,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:23:24,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:23:24,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:23:24,925 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:23:24,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 13:23:25,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 13:23:25,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:23:25,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:23:25,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:23:25,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 166 conjuncts are in the unsatisfiable core [2025-03-03 13:23:25,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:23:25,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-03-03 13:23:25,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 13:23:25,498 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-03 13:23:25,499 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 16 treesize of output 15 [2025-03-03 13:23:25,522 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-03 13:23:25,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-03 13:23:25,595 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-03-03 13:23:25,606 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-03-03 13:23:25,611 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-03-03 13:23:25,668 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-03-03 13:23:25,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 13:23:25,692 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-03-03 13:23:25,813 INFO L349 Elim1Store]: treesize reduction 56, result has 8.2 percent of original size [2025-03-03 13:23:25,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 145 treesize of output 128 [2025-03-03 13:23:25,825 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2025-03-03 13:23:25,826 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 3 case distinctions, treesize of input 148 treesize of output 102 [2025-03-03 13:23:25,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:23:25,832 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 21 [2025-03-03 13:23:25,835 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 70 treesize of output 58 [2025-03-03 13:23:25,840 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 59 treesize of output 26 [2025-03-03 13:23:25,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2025-03-03 13:23:25,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2025-03-03 13:23:25,991 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 64 treesize of output 24 [2025-03-03 13:23:25,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2025-03-03 13:23:25,998 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-03-03 13:23:26,002 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 15 treesize of output 7 [2025-03-03 13:23:26,204 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-03 13:23:26,204 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 31 treesize of output 28 [2025-03-03 13:23:26,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:23:26,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 43 [2025-03-03 13:23:26,234 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-03 13:23:26,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-03 13:23:26,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2025-03-03 13:23:26,494 INFO L349 Elim1Store]: treesize reduction 72, result has 27.3 percent of original size [2025-03-03 13:23:26,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 428 treesize of output 186 [2025-03-03 13:23:26,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 71 [2025-03-03 13:23:26,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:23:26,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 19 [2025-03-03 13:23:26,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:23:26,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:23:26,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:23:26,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:23:26,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 49 [2025-03-03 13:23:26,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2025-03-03 13:23:26,766 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 130 treesize of output 82 [2025-03-03 13:23:26,780 INFO L349 Elim1Store]: treesize reduction 24, result has 27.3 percent of original size [2025-03-03 13:23:26,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 68 treesize of output 38 [2025-03-03 13:23:26,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-03 13:23:26,858 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:23:26,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:23:26,976 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_685 Int) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse4)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse4))) (select (store (store (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) .cse1 v_ArrVal_685)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_692) .cse2 v_ArrVal_686) (select (select (let ((.cse3 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 (store (select |c_#memory_$Pointer$#1.base| .cse0) .cse1 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (store .cse5 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4) .cse0) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| .cse2))))) (store .cse3 .cse2 (store (select .cse3 .cse2) .cse4 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse6) .cse7))) (+ 8 (select (select (let ((.cse8 (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_690) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_691))) (store .cse8 .cse2 (store (select .cse8 .cse2) .cse4 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse6) .cse7))))))) is different from false [2025-03-03 13:23:26,990 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_685 Int) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse4)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse4))) (select (store (store (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) .cse1 v_ArrVal_685)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_692) .cse2 v_ArrVal_686) (select (select (let ((.cse3 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 (store (select |c_#memory_$Pointer$#1.base| .cse0) .cse1 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)))) (store .cse5 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (store (store (select .cse5 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) .cse0) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| .cse2))))) (store .cse3 .cse2 (store (select .cse3 .cse2) .cse4 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|))) .cse6) .cse7))) (+ 8 (select (select (let ((.cse8 (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_690) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_691))) (store .cse8 .cse2 (store (select .cse8 .cse2) .cse4 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|))) .cse6) .cse7))))))) is different from false [2025-03-03 13:23:27,073 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_685 Int) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18| Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18| v_ArrVal_704)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (select (select .cse6 .cse2) .cse4)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18| v_ArrVal_706) .cse2) .cse4))) (select (store (store (store |c_#memory_int#1| .cse0 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18| v_ArrVal_705) .cse0) .cse1 v_ArrVal_685)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18| v_ArrVal_692) .cse2 v_ArrVal_686) (select (select (let ((.cse3 (let ((.cse5 (store (select .cse6 .cse0) .cse1 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18|))) (store (store |c_#memory_$Pointer$#1.base| .cse0 .cse5) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18| (store (store (select (store .cse6 .cse0 .cse5) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18|) 4 .cse0) 0 .cse2))))) (store .cse3 .cse2 (store (select .cse3 .cse2) .cse4 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18|))) .cse7) .cse8))) (+ (select (select (let ((.cse9 (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_690) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18| v_ArrVal_691))) (store .cse9 .cse2 (store (select .cse9 .cse2) .cse4 0))) .cse7) .cse8) 8))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18|) 0)))) is different from false [2025-03-03 13:23:27,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663298776] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:23:27,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:23:27,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 44 [2025-03-03 13:23:27,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692933028] [2025-03-03 13:23:27,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:23:27,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-03 13:23:27,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:23:27,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-03 13:23:27,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2024, Unknown=3, NotChecked=276, Total=2450 [2025-03-03 13:23:27,079 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 44 states, 40 states have (on average 1.3) internal successors, (52), 35 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:23:28,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:23:28,673 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2025-03-03 13:23:28,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 13:23:28,674 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 1.3) internal successors, (52), 35 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2025-03-03 13:23:28,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:23:28,675 INFO L225 Difference]: With dead ends: 68 [2025-03-03 13:23:28,675 INFO L226 Difference]: Without dead ends: 66 [2025-03-03 13:23:28,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=259, Invalid=3532, Unknown=3, NotChecked=366, Total=4160 [2025-03-03 13:23:28,676 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 36 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:23:28,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 297 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 13:23:28,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-03 13:23:28,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 53. [2025-03-03 13:23:28,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 13:23:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2025-03-03 13:23:28,683 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 36 [2025-03-03 13:23:28,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:23:28,683 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2025-03-03 13:23:28,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 1.3) internal successors, (52), 35 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:23:28,683 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2025-03-03 13:23:28,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 13:23:28,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:23:28,684 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:23:28,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 13:23:28,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:23:28,885 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:23:28,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:23:28,885 INFO L85 PathProgramCache]: Analyzing trace with hash -654881085, now seen corresponding path program 1 times [2025-03-03 13:23:28,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:23:28,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446330740] [2025-03-03 13:23:28,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:23:28,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:23:28,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 13:23:28,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:23:28,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:23:28,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:23:29,959 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:23:29,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:23:29,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446330740] [2025-03-03 13:23:29,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446330740] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:23:29,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004780709] [2025-03-03 13:23:29,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:23:29,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:23:29,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:23:29,963 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:23:29,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 13:23:30,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 13:23:30,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:23:30,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:23:30,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:23:30,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 107 conjuncts are in the unsatisfiable core [2025-03-03 13:23:30,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:23:30,430 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-03-03 13:23:30,521 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from false [2025-03-03 13:23:30,522 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from true [2025-03-03 13:23:30,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 13:23:30,541 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from false [2025-03-03 13:23:30,543 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from true [2025-03-03 13:23:30,568 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-03 13:23:30,569 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 16 treesize of output 15 [2025-03-03 13:23:30,572 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-03-03 13:23:30,575 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) is different from false [2025-03-03 13:23:30,576 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) is different from true [2025-03-03 13:23:30,589 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from false [2025-03-03 13:23:30,591 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from true [2025-03-03 13:23:30,617 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2025-03-03 13:23:30,617 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 2 case distinctions, treesize of input 67 treesize of output 46 [2025-03-03 13:23:30,636 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse1 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (= .cse0 (select .cse1 0))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)))))) is different from false [2025-03-03 13:23:30,638 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse1 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (= .cse0 (select .cse1 0))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)))))) is different from true [2025-03-03 13:23:30,660 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse3 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) .cse0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))))) (or (= .cse1 (select .cse3 0)) (= .cse1 .cse0)))))) is different from false [2025-03-03 13:23:30,661 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse3 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) .cse0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))))) (or (= .cse1 (select .cse3 0)) (= .cse1 .cse0)))))) is different from true [2025-03-03 13:23:30,675 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-03-03 13:23:30,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 27 [2025-03-03 13:23:30,687 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2025-03-03 13:23:30,689 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2025-03-03 13:23:30,712 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2025-03-03 13:23:30,714 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2025-03-03 13:23:30,749 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0))))) is different from false [2025-03-03 13:23:30,750 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0))))) is different from true [2025-03-03 13:23:30,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:23:30,799 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-03 13:23:30,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 53 [2025-03-03 13:23:30,822 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse3 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2))) |v_old(#valid)_AFTER_CALL_12|))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) .cse0)) (or (= .cse1 (select .cse3 0)) (= .cse1 .cse0)) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse4 (select |v_#valid_BEFORE_CALL_11| .cse4)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse5) 0)))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|))))) is different from false [2025-03-03 13:23:30,824 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse3 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2))) |v_old(#valid)_AFTER_CALL_12|))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) .cse0)) (or (= .cse1 (select .cse3 0)) (= .cse1 .cse0)) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse4 (select |v_#valid_BEFORE_CALL_11| .cse4)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse5) 0)))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|))))) is different from true [2025-03-03 13:23:30,866 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse3 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2))) |v_old(#valid)_AFTER_CALL_12|))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) .cse0)) (or (= .cse1 (select .cse3 0)) (= .cse1 .cse0)) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse4 (select |v_#valid_BEFORE_CALL_11| .cse4)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse5) 0)))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0))))) is different from false [2025-03-03 13:23:30,868 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse3 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2))) |v_old(#valid)_AFTER_CALL_12|))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) .cse0)) (or (= .cse1 (select .cse3 0)) (= .cse1 .cse0)) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse4 (select |v_#valid_BEFORE_CALL_11| .cse4)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse5) 0)))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0))))) is different from true [2025-03-03 13:23:30,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:23:30,939 INFO L349 Elim1Store]: treesize reduction 574, result has 8.6 percent of original size [2025-03-03 13:23:30,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 333 treesize of output 114 [2025-03-03 13:23:30,942 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 71 treesize of output 55 [2025-03-03 13:23:30,966 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse3 (select .cse7 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse2 (select .cse0 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select .cse0 0) .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|))) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse6) 0)))) (exists ((v_arrayElimCell_79 Int)) (= .cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) v_arrayElimCell_79))) (or (= .cse2 .cse1) (= .cse2 (select .cse7 0))))))))) is different from false [2025-03-03 13:23:30,968 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse3 (select .cse7 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse2 (select .cse0 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select .cse0 0) .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|))) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse6) 0)))) (exists ((v_arrayElimCell_79 Int)) (= .cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) v_arrayElimCell_79))) (or (= .cse2 .cse1) (= .cse2 (select .cse7 0))))))))) is different from true [2025-03-03 13:23:31,011 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse3 (select .cse7 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse2 (select .cse0 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse0 0) .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|))) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse6) 0)))) (exists ((v_arrayElimCell_79 Int)) (= .cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) v_arrayElimCell_79))) (or (= .cse2 .cse1) (= .cse2 (select .cse7 0))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1))))))) is different from false [2025-03-03 13:23:31,013 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse3 (select .cse7 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse2 (select .cse0 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse0 0) .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|))) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse6) 0)))) (exists ((v_arrayElimCell_79 Int)) (= .cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) v_arrayElimCell_79))) (or (= .cse2 .cse1) (= .cse2 (select .cse7 0))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1))))))) is different from true [2025-03-03 13:23:31,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:23:31,073 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 178 treesize of output 122 [2025-03-03 13:23:31,087 INFO L349 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2025-03-03 13:23:31,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 94 treesize of output 36 [2025-03-03 13:23:31,096 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-03 13:23:31,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-03-03 13:23:31,112 WARN L851 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_82 Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_82) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_13| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_12| v_arrayElimCell_82) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_#t~mem21#1.base|) 0))) is different from false [2025-03-03 13:23:35,278 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_82 Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_82) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_13| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_12| v_arrayElimCell_82) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_#t~mem21#1.base|) 0))) is different from true [2025-03-03 13:23:35,294 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2025-03-03 13:23:35,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:23:35,858 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 598 treesize of output 486 [2025-03-03 13:23:37,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004780709] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:23:37,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:23:37,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 40 [2025-03-03 13:23:37,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943671520] [2025-03-03 13:23:37,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:23:37,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-03 13:23:37,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:23:37,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-03 13:23:37,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=857, Unknown=28, NotChecked=994, Total=1980 [2025-03-03 13:23:37,651 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 40 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 31 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:23:38,993 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from false [2025-03-03 13:23:39,002 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from true [2025-03-03 13:23:39,012 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2025-03-03 13:23:39,021 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from true [2025-03-03 13:23:39,031 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) .cse1) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (not .cse1))) is different from false [2025-03-03 13:23:39,040 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) .cse1) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (not .cse1))) is different from true [2025-03-03 13:23:39,055 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse1 (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not .cse1) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) is different from false [2025-03-03 13:23:39,064 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse1 (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not .cse1) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) is different from true [2025-03-03 13:23:39,095 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse1 (select .cse4 4))) (let ((.cse0 (= .cse1 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (.cse2 (select .cse4 0))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= .cse1 .cse2)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (not .cse0) (= (select |c_#valid| .cse2) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))))))) is different from false [2025-03-03 13:23:39,104 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse1 (select .cse4 4))) (let ((.cse0 (= .cse1 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (.cse2 (select .cse4 0))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= .cse1 .cse2)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (not .cse0) (= (select |c_#valid| .cse2) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))))))) is different from true [2025-03-03 13:23:39,200 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse5 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse6 4)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse2))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) .cse0)) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |c_#valid| .cse3)))))) (not (= (select .cse4 4) (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse1 (select .cse6 0)) (= .cse1 .cse0)) (= (select |c_#valid| (select .cse4 0)) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0)))))) is different from false [2025-03-03 13:23:39,210 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse5 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse6 4)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse2))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) .cse0)) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |c_#valid| .cse3)))))) (not (= (select .cse4 4) (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse1 (select .cse6 0)) (= .cse1 .cse0)) (= (select |c_#valid| (select .cse4 0)) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0)))))) is different from true [2025-03-03 13:23:39,328 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0)))) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2025-03-03 13:23:39,338 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0)))) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2025-03-03 13:23:39,351 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0)))) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)))) is different from false [2025-03-03 13:23:39,361 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0)))) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)))) is different from true [2025-03-03 13:23:39,383 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse3 (select .cse5 4))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (select .cse0 0))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= (select .cse0 4) .cse1)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) .cse2)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= .cse3 (select .cse5 0)) (= .cse3 .cse2)) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse7) 0)))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0))))) is different from false [2025-03-03 13:23:39,394 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse3 (select .cse5 4))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (select .cse0 0))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= (select .cse0 4) .cse1)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) .cse2)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= .cse3 (select .cse5 0)) (= .cse3 .cse2)) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse7) 0)))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0))))) is different from true [2025-03-03 13:23:39,551 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse3 (select .cse6 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 (store (select |c_#memory_$Pointer$#1.base| .cse0) (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (store .cse5 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4) .cse0) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| .cse1))) .cse1) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) .cse2)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= .cse3 (select .cse6 0)) (= .cse3 .cse2)) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse7 (select |v_#valid_BEFORE_CALL_11| .cse7)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse8) 0)))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0))))) is different from false [2025-03-03 13:23:39,563 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse3 (select .cse6 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 (store (select |c_#memory_$Pointer$#1.base| .cse0) (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (store .cse5 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4) .cse0) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| .cse1))) .cse1) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) .cse2)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= .cse3 (select .cse6 0)) (= .cse3 .cse2)) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse7 (select |v_#valid_BEFORE_CALL_11| .cse7)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse8) 0)))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0))))) is different from true [2025-03-03 13:23:39,612 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse7 0))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse4 (select .cse10 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (select .cse1 4))) (and (= (select .cse0 0) 0) (= (select .cse1 0) .cse2) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse5 (select |v_old(#valid)_AFTER_CALL_12| .cse5))) |v_old(#valid)_AFTER_CALL_12|))) (not (let ((.cse6 (select |c_#memory_$Pointer$#1.base| (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= (select .cse6 0) (select .cse6 4)))) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse8 (select |v_#valid_BEFORE_CALL_11| .cse8)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse9) 0)))) (exists ((v_arrayElimCell_79 Int)) (= .cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) v_arrayElimCell_79))) (or (= .cse3 .cse2) (= .cse3 (select .cse10 0)))))))))) is different from false [2025-03-03 13:23:39,622 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse7 0))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse4 (select .cse10 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (select .cse1 4))) (and (= (select .cse0 0) 0) (= (select .cse1 0) .cse2) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse5 (select |v_old(#valid)_AFTER_CALL_12| .cse5))) |v_old(#valid)_AFTER_CALL_12|))) (not (let ((.cse6 (select |c_#memory_$Pointer$#1.base| (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= (select .cse6 0) (select .cse6 4)))) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse8 (select |v_#valid_BEFORE_CALL_11| .cse8)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse9) 0)))) (exists ((v_arrayElimCell_79 Int)) (= .cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) v_arrayElimCell_79))) (or (= .cse3 .cse2) (= .cse3 (select .cse10 0)))))))))) is different from true [2025-03-03 13:23:39,782 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse6 0))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse4 (select .cse9 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (select .cse1 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse1 0) .cse2) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse5 (select |v_old(#valid)_AFTER_CALL_12| .cse5))) |v_old(#valid)_AFTER_CALL_12|))) (not (= (select (select |c_#memory_$Pointer$#1.base| (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse7 (select |v_#valid_BEFORE_CALL_11| .cse7)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse8) 0)))) (exists ((v_arrayElimCell_79 Int)) (= .cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) v_arrayElimCell_79))) (or (= .cse3 .cse2) (= .cse3 (select .cse9 0))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2)))))))) is different from false [2025-03-03 13:23:39,792 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse6 0))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse4 (select .cse9 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (select .cse1 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse1 0) .cse2) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse5 (select |v_old(#valid)_AFTER_CALL_12| .cse5))) |v_old(#valid)_AFTER_CALL_12|))) (not (= (select (select |c_#memory_$Pointer$#1.base| (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse7 (select |v_#valid_BEFORE_CALL_11| .cse7)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse8) 0)))) (exists ((v_arrayElimCell_79 Int)) (= .cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) v_arrayElimCell_79))) (or (= .cse3 .cse2) (= .cse3 (select .cse9 0))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2)))))))) is different from true [2025-03-03 13:23:39,849 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base|)) (exists ((v_arrayElimCell_82 Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_82) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_13| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_12| v_arrayElimCell_82) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_#t~mem21#1.base|) 0)))) is different from false [2025-03-03 13:23:39,857 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base|)) (exists ((v_arrayElimCell_82 Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_82) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_13| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_12| v_arrayElimCell_82) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_#t~mem21#1.base|) 0)))) is different from true [2025-03-03 13:23:40,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:23:40,120 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2025-03-03 13:23:40,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 13:23:40,121 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 31 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2025-03-03 13:23:40,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:23:40,121 INFO L225 Difference]: With dead ends: 73 [2025-03-03 13:23:40,121 INFO L226 Difference]: Without dead ends: 68 [2025-03-03 13:23:40,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 27 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=137, Invalid=973, Unknown=54, NotChecked=2376, Total=3540 [2025-03-03 13:23:40,122 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 1492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1194 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 13:23:40,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 395 Invalid, 1492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 292 Invalid, 0 Unknown, 1194 Unchecked, 1.7s Time] [2025-03-03 13:23:40,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-03 13:23:40,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-03 13:23:40,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 57 states have internal predecessors, (65), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:23:40,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2025-03-03 13:23:40,130 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 36 [2025-03-03 13:23:40,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:23:40,130 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2025-03-03 13:23:40,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 31 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:23:40,130 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2025-03-03 13:23:40,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 13:23:40,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:23:40,131 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:23:40,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 13:23:40,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:23:40,331 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:23:40,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:23:40,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1499352956, now seen corresponding path program 1 times [2025-03-03 13:23:40,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:23:40,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960545268] [2025-03-03 13:23:40,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:23:40,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:23:40,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 13:23:40,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:23:40,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:23:40,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:23:40,574 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 13:23:40,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:23:40,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960545268] [2025-03-03 13:23:40,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960545268] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:23:40,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791370968] [2025-03-03 13:23:40,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:23:40,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:23:40,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:23:40,576 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:23:40,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 13:23:40,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 13:23:40,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:23:40,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:23:40,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:23:40,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 13:23:40,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:23:40,823 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:23:40,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:23:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 13:23:41,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791370968] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:23:41,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:23:41,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-03 13:23:41,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653207086] [2025-03-03 13:23:41,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:23:41,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:23:41,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:23:41,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:23:41,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:23:41,034 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-03 13:23:41,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:23:41,205 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2025-03-03 13:23:41,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:23:41,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2025-03-03 13:23:41,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:23:41,207 INFO L225 Difference]: With dead ends: 98 [2025-03-03 13:23:41,207 INFO L226 Difference]: Without dead ends: 53 [2025-03-03 13:23:41,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:23:41,208 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:23:41,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:23:41,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-03 13:23:41,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-03 13:23:41,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 13:23:41,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2025-03-03 13:23:41,219 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 36 [2025-03-03 13:23:41,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:23:41,219 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2025-03-03 13:23:41,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-03 13:23:41,220 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2025-03-03 13:23:41,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 13:23:41,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:23:41,220 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:23:41,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 13:23:41,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:23:41,425 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:23:41,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:23:41,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1825352147, now seen corresponding path program 2 times [2025-03-03 13:23:41,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:23:41,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90860252] [2025-03-03 13:23:41,425 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:23:41,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:23:41,442 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-03 13:23:41,489 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:23:41,490 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:23:41,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:23:49,773 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:23:49,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:23:49,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90860252] [2025-03-03 13:23:49,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90860252] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:23:49,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033515440] [2025-03-03 13:23:49,773 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:23:49,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:23:49,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:23:49,775 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:23:49,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 13:23:49,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-03 13:23:49,997 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:23:49,997 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:23:49,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:23:50,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 151 conjuncts are in the unsatisfiable core [2025-03-03 13:23:50,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:23:50,291 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-03-03 13:23:51,995 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_18| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from false [2025-03-03 13:23:52,003 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_18| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from true [2025-03-03 13:23:52,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 13:23:52,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 13:23:52,157 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_18| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from false [2025-03-03 13:23:52,166 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_18| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from true [2025-03-03 13:23:52,286 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-03 13:23:52,286 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 16 treesize of output 15 [2025-03-03 13:23:52,469 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-03 13:23:52,469 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 16 treesize of output 15 [2025-03-03 13:23:52,497 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-03-03 13:23:52,584 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) .cse0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) .cse0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_18| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_18| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) is different from false [2025-03-03 13:23:52,596 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) .cse0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) .cse0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_18| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_18| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) is different from true [2025-03-03 13:23:52,745 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_18| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_18| .cse0 (select |c_#valid| .cse0)))))) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (or .cse1 (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) is different from false [2025-03-03 13:23:52,754 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_18| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_18| .cse0 (select |c_#valid| .cse0)))))) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (or .cse1 (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) is different from true [2025-03-03 13:23:52,928 INFO L349 Elim1Store]: treesize reduction 42, result has 45.5 percent of original size [2025-03-03 13:23:52,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 109 [2025-03-03 13:23:52,960 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 22 treesize of output 26 [2025-03-03 13:23:52,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-03-03 13:23:53,211 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 13:23:53,211 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 29 treesize of output 5 [2025-03-03 13:23:53,402 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2025-03-03 13:23:53,402 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 1 case distinctions, treesize of input 67 treesize of output 42 [2025-03-03 13:23:53,526 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse1 (select .cse3 4))) (let ((.cse2 (= .cse1 |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_18| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_18| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse2 (= .cse1 (select .cse3 0))) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 0) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse4 (= (select .cse5 4) 0))) (or (and .cse2 .cse4) (and (= (select .cse5 0) 0) .cse4 (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_5) .cse1))) (and (= .cse6 (select |c_#memory_$Pointer$#1.offset| .cse1)) (= (store .cse6 4 0) v_DerPreprocessor_5)))) (not .cse2))))))))) is different from false [2025-03-03 13:23:53,536 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse1 (select .cse3 4))) (let ((.cse2 (= .cse1 |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_18| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_18| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse2 (= .cse1 (select .cse3 0))) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 0) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse4 (= (select .cse5 4) 0))) (or (and .cse2 .cse4) (and (= (select .cse5 0) 0) .cse4 (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_5) .cse1))) (and (= .cse6 (select |c_#memory_$Pointer$#1.offset| .cse1)) (= (store .cse6 4 0) v_DerPreprocessor_5)))) (not .cse2))))))))) is different from true [2025-03-03 13:23:53,762 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse2 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= (select |c_#valid| .cse1) 1) (= .cse0 (select .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_18| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_18| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_18| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_18| .cse0) 1))) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| .cse1))) (let ((.cse4 (= (select .cse5 4) 0))) (or (and .cse4 (= .cse0 .cse1)) (and .cse4 (= (select .cse5 0) 0) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_4) .cse1 v_DerPreprocessor_5) .cse0))) (and (= (select |c_#memory_$Pointer$#1.offset| .cse0) .cse6) (= (store .cse6 4 0) v_DerPreprocessor_5)))))))))))) is different from false [2025-03-03 13:23:53,772 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse2 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= (select |c_#valid| .cse1) 1) (= .cse0 (select .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_18| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_18| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_18| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_18| .cse0) 1))) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| .cse1))) (let ((.cse4 (= (select .cse5 4) 0))) (or (and .cse4 (= .cse0 .cse1)) (and .cse4 (= (select .cse5 0) 0) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_4) .cse1 v_DerPreprocessor_5) .cse0))) (and (= (select |c_#memory_$Pointer$#1.offset| .cse0) .cse6) (= (store .cse6 4 0) v_DerPreprocessor_5)))))))))))) is different from true [2025-03-03 13:23:53,822 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-03 13:23:53,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 178 treesize of output 97 [2025-03-03 13:23:53,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:23:53,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:23:53,863 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 54 treesize of output 34 [2025-03-03 13:23:53,880 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 34 treesize of output 28 [2025-03-03 13:23:53,980 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimCell_98) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse0) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2025-03-03 13:23:53,990 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimCell_98) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse0) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2025-03-03 13:23:54,104 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimCell_98) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse0) 0)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2025-03-03 13:23:54,113 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimCell_98) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse0) 0)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2025-03-03 13:23:54,353 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimCell_98) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse0) 0)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from false [2025-03-03 13:23:54,363 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimCell_98) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse0) 0)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from true [2025-03-03 13:23:54,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:23:54,674 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-03 13:23:54,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 186 treesize of output 133 [2025-03-03 13:23:55,008 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2025-03-03 13:23:55,008 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 165 treesize of output 181 [2025-03-03 13:23:55,311 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse2 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= .cse0 (select .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1))) (let ((.cse3 (= (select .cse4 4) 0))) (or (and .cse3 (= (select .cse4 0) 0)) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1) (and .cse3 (= .cse0 .cse1))))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimCell_98) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse5) 0)))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_19| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_20| |v_old(#valid)_AFTER_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_20| .cse7 (select |v_old(#valid)_AFTER_CALL_19| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))))))) is different from false [2025-03-03 13:23:55,321 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse2 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= .cse0 (select .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1))) (let ((.cse3 (= (select .cse4 4) 0))) (or (and .cse3 (= (select .cse4 0) 0)) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1) (and .cse3 (= .cse0 .cse1))))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimCell_98) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse5) 0)))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_19| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_20| |v_old(#valid)_AFTER_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_20| .cse7 (select |v_old(#valid)_AFTER_CALL_19| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))))))) is different from true [2025-03-03 13:23:55,605 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse2 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= .cse0 (select .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_19| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_20| |v_old(#valid)_AFTER_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_20| .cse3 (select |v_old(#valid)_AFTER_CALL_19| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimCell_98) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse4) 0)))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| .cse1))) (let ((.cse6 (= (select .cse7 4) 0))) (or (and .cse6 (= (select .cse7 0) 0)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1) (and .cse6 (= .cse0 .cse1))))))))) is different from false [2025-03-03 13:23:55,615 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse2 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= .cse0 (select .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_19| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_20| |v_old(#valid)_AFTER_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_20| .cse3 (select |v_old(#valid)_AFTER_CALL_19| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimCell_98) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse4) 0)))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| .cse1))) (let ((.cse6 (= (select .cse7 4) 0))) (or (and .cse6 (= (select .cse7 0) 0)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1) (and .cse6 (= .cse0 .cse1))))))))) is different from true [2025-03-03 13:23:55,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:23:55,980 INFO L349 Elim1Store]: treesize reduction 420, result has 7.7 percent of original size [2025-03-03 13:23:55,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 488 treesize of output 218 [2025-03-03 13:23:56,253 INFO L349 Elim1Store]: treesize reduction 92, result has 35.7 percent of original size [2025-03-03 13:23:56,254 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 227 treesize of output 187 [2025-03-03 13:23:56,677 INFO L349 Elim1Store]: treesize reduction 349, result has 26.2 percent of original size [2025-03-03 13:23:56,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 158 treesize of output 268 [2025-03-03 13:23:56,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:23:56,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2025-03-03 13:23:56,957 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 0 case distinctions, treesize of input 83 treesize of output 20 [2025-03-03 13:23:57,128 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-03-03 13:23:57,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 13:23:57,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:23:57,330 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-03-03 13:23:57,336 INFO L158 Benchmark]: Toolchain (without parser) took 67387.56ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 122.2MB in the beginning and 396.2MB in the end (delta: -274.0MB). Peak memory consumption was 294.3MB. Max. memory is 16.1GB. [2025-03-03 13:23:57,336 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:23:57,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.66ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 104.2MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 13:23:57,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.13ms. Allocated memory is still 167.8MB. Free memory was 103.8MB in the beginning and 102.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:23:57,336 INFO L158 Benchmark]: Boogie Preprocessor took 39.45ms. Allocated memory is still 167.8MB. Free memory was 102.0MB in the beginning and 99.5MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:23:57,337 INFO L158 Benchmark]: IcfgBuilder took 319.12ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 80.4MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 13:23:57,337 INFO L158 Benchmark]: TraceAbstraction took 66676.78ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 80.0MB in the beginning and 396.2MB in the end (delta: -316.2MB). Peak memory consumption was 252.4MB. Max. memory is 16.1GB. [2025-03-03 13:23:57,338 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.66ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 104.2MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.13ms. Allocated memory is still 167.8MB. Free memory was 103.8MB in the beginning and 102.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.45ms. Allocated memory is still 167.8MB. Free memory was 102.0MB in the beginning and 99.5MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 319.12ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 80.4MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 66676.78ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 80.0MB in the beginning and 396.2MB in the end (delta: -316.2MB). Peak memory consumption was 252.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2025-03-03 13:23:57,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:23:59,213 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:23:59,291 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 13:23:59,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:23:59,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:23:59,313 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:23:59,313 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:23:59,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:23:59,314 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:23:59,314 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:23:59,314 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:23:59,314 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:23:59,314 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:23:59,314 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:23:59,314 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:23:59,314 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:23:59,314 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:23:59,314 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:23:59,314 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:23:59,314 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:23:59,314 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:23:59,314 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:23:59,315 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:23:59,315 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 13:23:59,315 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 13:23:59,315 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 13:23:59,315 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:23:59,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:23:59,315 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:23:59,315 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:23:59,315 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:23:59,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:23:59,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:23:59,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:23:59,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:23:59,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:23:59,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:23:59,315 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:23:59,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:23:59,315 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 13:23:59,315 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 13:23:59,315 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:23:59,315 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:23:59,315 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:23:59,316 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:23:59,316 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 [2025-03-03 13:23:59,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:23:59,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:23:59,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:23:59,554 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:23:59,556 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:23:59,557 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2025-03-03 13:24:00,720 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a1dc28d9/d48481d628c8428bb6c3f370ba881fa1/FLAGd25cf50f9 [2025-03-03 13:24:00,906 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:24:00,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2025-03-03 13:24:00,921 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a1dc28d9/d48481d628c8428bb6c3f370ba881fa1/FLAGd25cf50f9 [2025-03-03 13:24:00,936 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a1dc28d9/d48481d628c8428bb6c3f370ba881fa1 [2025-03-03 13:24:00,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:24:00,940 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:24:00,941 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:24:00,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:24:00,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:24:00,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:24:00" (1/1) ... [2025-03-03 13:24:00,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c3e8c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:00, skipping insertion in model container [2025-03-03 13:24:00,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:24:00" (1/1) ... [2025-03-03 13:24:00,977 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:24:01,217 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i[24672,24685] [2025-03-03 13:24:01,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:24:01,230 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:24:01,269 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i[24672,24685] [2025-03-03 13:24:01,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:24:01,301 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:24:01,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:01 WrapperNode [2025-03-03 13:24:01,301 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:24:01,302 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:24:01,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:24:01,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:24:01,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:01" (1/1) ... [2025-03-03 13:24:01,318 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:01" (1/1) ... [2025-03-03 13:24:01,336 INFO L138 Inliner]: procedures = 130, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 143 [2025-03-03 13:24:01,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:24:01,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:24:01,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:24:01,340 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:24:01,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:01" (1/1) ... [2025-03-03 13:24:01,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:01" (1/1) ... [2025-03-03 13:24:01,356 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:01" (1/1) ... [2025-03-03 13:24:01,379 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 20, 9]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 14 writes are split as follows [0, 13, 1]. [2025-03-03 13:24:01,380 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:01" (1/1) ... [2025-03-03 13:24:01,380 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:01" (1/1) ... [2025-03-03 13:24:01,394 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:01" (1/1) ... [2025-03-03 13:24:01,395 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:01" (1/1) ... [2025-03-03 13:24:01,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:01" (1/1) ... [2025-03-03 13:24:01,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:01" (1/1) ... [2025-03-03 13:24:01,402 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:24:01,403 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:24:01,403 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:24:01,403 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:24:01,404 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:01" (1/1) ... [2025-03-03 13:24:01,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:24:01,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:24:01,433 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 13:24:01,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 13:24:01,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-03 13:24:01,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-03 13:24:01,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-03 13:24:01,458 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-03 13:24:01,458 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-03 13:24:01,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 13:24:01,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:24:01,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 13:24:01,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-03 13:24:01,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-03 13:24:01,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-03 13:24:01,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-03 13:24:01,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-03 13:24:01,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-03 13:24:01,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 13:24:01,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-03 13:24:01,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-03 13:24:01,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-03 13:24:01,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-03 13:24:01,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-03 13:24:01,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-03 13:24:01,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 13:24:01,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-03 13:24:01,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-03 13:24:01,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:24:01,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:24:01,595 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:24:01,597 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:24:01,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L629: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-03-03 13:24:01,961 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-03 13:24:01,987 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-03-03 13:24:01,987 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:24:01,995 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:24:01,996 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:24:01,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:24:01 BoogieIcfgContainer [2025-03-03 13:24:01,996 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:24:01,999 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:24:01,999 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:24:02,002 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:24:02,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:24:00" (1/3) ... [2025-03-03 13:24:02,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9db44e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:24:02, skipping insertion in model container [2025-03-03 13:24:02,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:01" (2/3) ... [2025-03-03 13:24:02,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9db44e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:24:02, skipping insertion in model container [2025-03-03 13:24:02,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:24:01" (3/3) ... [2025-03-03 13:24:02,005 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2025-03-03 13:24:02,016 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:24:02,017 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_append_unequal.i that has 2 procedures, 34 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-03 13:24:02,054 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:24:02,062 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@27f02cd6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:24:02,062 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:24:02,066 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 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-03-03 13:24:02,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 13:24:02,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:24:02,071 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:24:02,071 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:24:02,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:24:02,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1837586127, now seen corresponding path program 1 times [2025-03-03 13:24:02,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 13:24:02,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1287380170] [2025-03-03 13:24:02,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:24:02,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:24:02,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:24:02,091 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:24:02,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 13:24:02,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 13:24:02,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:24:02,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:24:02,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:24:02,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 13:24:02,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:24:02,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-03 13:24:02,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:24:02,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:24:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:24:02,565 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 13:24:02,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287380170] [2025-03-03 13:24:02,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287380170] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:24:02,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:24:02,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2025-03-03 13:24:02,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073064013] [2025-03-03 13:24:02,567 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:24:02,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 13:24:02,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 13:24:02,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 13:24:02,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:24:02,586 INFO L87 Difference]: Start difference. First operand has 34 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 13:24:06,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 13:24:11,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 13:24:12,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:24:12,112 INFO L93 Difference]: Finished difference Result 91 states and 125 transitions. [2025-03-03 13:24:12,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 13:24:12,114 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2025-03-03 13:24:12,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:24:12,117 INFO L225 Difference]: With dead ends: 91 [2025-03-03 13:24:12,117 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 13:24:12,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:24:12,120 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 24 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2025-03-03 13:24:12,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 255 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2025-03-03 13:24:12,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 13:24:12,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2025-03-03 13:24:12,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 13:24:12,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2025-03-03 13:24:12,141 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 23 [2025-03-03 13:24:12,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:24:12,141 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2025-03-03 13:24:12,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 13:24:12,142 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2025-03-03 13:24:12,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 13:24:12,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:24:12,142 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:24:12,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 13:24:12,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:24:12,343 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:24:12,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:24:12,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1836662606, now seen corresponding path program 1 times [2025-03-03 13:24:12,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 13:24:12,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [375224496] [2025-03-03 13:24:12,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:24:12,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:24:12,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:24:12,346 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:24:12,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 13:24:12,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 13:24:12,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:24:12,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:24:12,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:24:12,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 13:24:12,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:24:12,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:24:12,504 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:24:12,504 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 13:24:12,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375224496] [2025-03-03 13:24:12,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375224496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:24:12,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:24:12,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:24:12,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707930290] [2025-03-03 13:24:12,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:24:12,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:24:12,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 13:24:12,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:24:12,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:24:12,506 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:24:12,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:24:12,538 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2025-03-03 13:24:12,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:24:12,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2025-03-03 13:24:12,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:24:12,540 INFO L225 Difference]: With dead ends: 50 [2025-03-03 13:24:12,541 INFO L226 Difference]: Without dead ends: 32 [2025-03-03 13:24:12,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-03-03 13:24:12,542 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 59 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-03-03 13:24:12,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 59 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:24:12,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-03 13:24:12,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2025-03-03 13:24:12,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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-03-03 13:24:12,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2025-03-03 13:24:12,549 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 23 [2025-03-03 13:24:12,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:24:12,550 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2025-03-03 13:24:12,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:24:12,550 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2025-03-03 13:24:12,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 13:24:12,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:24:12,551 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:24:12,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 13:24:12,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:24:12,751 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:24:12,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:24:12,752 INFO L85 PathProgramCache]: Analyzing trace with hash -173661198, now seen corresponding path program 1 times [2025-03-03 13:24:12,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 13:24:12,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [846209227] [2025-03-03 13:24:12,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:24:12,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:24:12,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:24:12,754 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:24:12,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 13:24:12,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 13:24:12,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 13:24:12,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:24:12,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:24:12,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 13:24:12,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:24:13,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-03 13:24:13,065 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:24:13,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:24:13,142 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 13:24:13,143 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 13:24:13,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846209227] [2025-03-03 13:24:13,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846209227] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:24:13,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:24:13,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 11 [2025-03-03 13:24:13,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200758081] [2025-03-03 13:24:13,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:24:13,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 13:24:13,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 13:24:13,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 13:24:13,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-03 13:24:13,144 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 13:24:17,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 13:24:23,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 13:24:23,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:24:23,270 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2025-03-03 13:24:23,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 13:24:23,271 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2025-03-03 13:24:23,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:24:23,271 INFO L225 Difference]: With dead ends: 59 [2025-03-03 13:24:23,271 INFO L226 Difference]: Without dead ends: 36 [2025-03-03 13:24:23,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-03-03 13:24:23,272 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:24:23,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 211 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 2 Unknown, 0 Unchecked, 10.0s Time] [2025-03-03 13:24:23,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-03 13:24:23,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2025-03-03 13:24:23,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 13:24:23,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2025-03-03 13:24:23,276 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 33 [2025-03-03 13:24:23,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:24:23,276 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2025-03-03 13:24:23,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 13:24:23,276 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2025-03-03 13:24:23,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 13:24:23,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:24:23,277 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:24:23,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0