./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/dll2n_append_equal.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 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:42:02,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:42:02,715 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:42:02,718 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:42:02,718 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:42:02,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:42:02,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:42:02,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:42:02,739 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:42:02,739 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:42:02,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:42:02,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:42:02,739 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:42:02,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:42:02,740 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:42:02,741 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:42:02,741 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:42:02,741 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:42:02,741 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:42:02,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:42:02,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:42:02,741 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:42:02,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:42:02,741 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:42:02,741 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:42:02,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:42:02,741 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:42:02,741 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:42:02,741 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:42:02,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:42:02,741 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:42:02,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:42:02,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:42:02,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:42:02,741 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:42:02,741 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:42:02,741 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:42:02,741 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:42:02,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:42:02,741 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:42:02,742 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:42:02,742 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:42:02,742 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:42:02,742 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 -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2025-03-16 17:42:02,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:42:02,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:42:02,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:42:02,976 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:42:02,976 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:42:02,977 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_equal.i [2025-03-16 17:42:04,120 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44f2e2998/633b56f8e6fa45148588b90948880287/FLAG73cd634d6 [2025-03-16 17:42:04,457 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:42:04,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2025-03-16 17:42:04,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44f2e2998/633b56f8e6fa45148588b90948880287/FLAG73cd634d6 [2025-03-16 17:42:04,476 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44f2e2998/633b56f8e6fa45148588b90948880287 [2025-03-16 17:42:04,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:42:04,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:42:04,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:42:04,480 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:42:04,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:42:04,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:42:04" (1/1) ... [2025-03-16 17:42:04,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f0ceb9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:04, skipping insertion in model container [2025-03-16 17:42:04,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:42:04" (1/1) ... [2025-03-16 17:42:04,507 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:42:04,729 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/dll2n_append_equal.i[24333,24346] [2025-03-16 17:42:04,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:42:04,740 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:42:04,772 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/dll2n_append_equal.i[24333,24346] [2025-03-16 17:42:04,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:42:04,794 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:42:04,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:04 WrapperNode [2025-03-16 17:42:04,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:42:04,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:42:04,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:42:04,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:42:04,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:04" (1/1) ... [2025-03-16 17:42:04,809 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:04" (1/1) ... [2025-03-16 17:42:04,824 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2025-03-16 17:42:04,824 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:42:04,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:42:04,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:42:04,825 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:42:04,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:04" (1/1) ... [2025-03-16 17:42:04,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:04" (1/1) ... [2025-03-16 17:42:04,832 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:04" (1/1) ... [2025-03-16 17:42:04,851 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 13, 6]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 9 writes are split as follows [0, 8, 1]. [2025-03-16 17:42:04,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:04" (1/1) ... [2025-03-16 17:42:04,855 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:04" (1/1) ... [2025-03-16 17:42:04,864 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:04" (1/1) ... [2025-03-16 17:42:04,868 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:04" (1/1) ... [2025-03-16 17:42:04,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:04" (1/1) ... [2025-03-16 17:42:04,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:04" (1/1) ... [2025-03-16 17:42:04,875 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:42:04,875 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:42:04,875 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:42:04,875 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:42:04,876 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:04" (1/1) ... [2025-03-16 17:42:04,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:42:04,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:42:04,905 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-16 17:42:04,908 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-16 17:42:04,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 17:42:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 17:42:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 17:42:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 17:42:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 17:42:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 17:42:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-16 17:42:04,928 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-16 17:42:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-16 17:42:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:42:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 17:42:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-16 17:42:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-16 17:42:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-16 17:42:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-16 17:42:04,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-16 17:42:04,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-16 17:42:04,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 17:42:04,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-16 17:42:04,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-16 17:42:04,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-16 17:42:04,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:42:04,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 17:42:04,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 17:42:04,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:42:04,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:42:05,035 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:42:05,036 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:42:05,192 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L622: 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-16 17:42:05,205 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L578: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-16 17:42:05,220 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-03-16 17:42:05,220 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:42:05,228 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:42:05,230 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:42:05,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:42:05 BoogieIcfgContainer [2025-03-16 17:42:05,230 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:42:05,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:42:05,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:42:05,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:42:05,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:42:04" (1/3) ... [2025-03-16 17:42:05,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364c1a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:42:05, skipping insertion in model container [2025-03-16 17:42:05,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:04" (2/3) ... [2025-03-16 17:42:05,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364c1a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:42:05, skipping insertion in model container [2025-03-16 17:42:05,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:42:05" (3/3) ... [2025-03-16 17:42:05,237 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2025-03-16 17:42:05,247 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:42:05,248 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_append_equal.i that has 2 procedures, 28 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-16 17:42:05,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:42:05,297 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;@3117b0d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:42:05,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 17:42:05,301 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 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-16 17:42:05,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-16 17:42:05,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:42:05,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:42:05,306 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:42:05,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:42:05,309 INFO L85 PathProgramCache]: Analyzing trace with hash 414113216, now seen corresponding path program 1 times [2025-03-16 17:42:05,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:42:05,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446553499] [2025-03-16 17:42:05,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:42:05,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:42:05,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 17:42:05,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 17:42:05,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:42:05,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:05,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:42:05,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:42:05,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446553499] [2025-03-16 17:42:05,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446553499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:42:05,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:42:05,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:42:05,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629788787] [2025-03-16 17:42:05,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:42:05,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:42:05,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:42:05,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:42:05,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:42:05,551 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:42:05,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:42:05,577 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2025-03-16 17:42:05,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:42:05,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-16 17:42:05,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:42:05,584 INFO L225 Difference]: With dead ends: 55 [2025-03-16 17:42:05,584 INFO L226 Difference]: Without dead ends: 28 [2025-03-16 17:42:05,586 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-16 17:42:05,590 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:42:05,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 66 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:42:05,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-16 17:42:05,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2025-03-16 17:42:05,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 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-16 17:42:05,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2025-03-16 17:42:05,619 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 14 [2025-03-16 17:42:05,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:42:05,619 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-03-16 17:42:05,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:42:05,620 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2025-03-16 17:42:05,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-16 17:42:05,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:42:05,621 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:42:05,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:42:05,622 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:42:05,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:42:05,622 INFO L85 PathProgramCache]: Analyzing trace with hash 943200191, now seen corresponding path program 1 times [2025-03-16 17:42:05,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:42:05,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437665250] [2025-03-16 17:42:05,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:42:05,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:42:05,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 17:42:05,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 17:42:05,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:42:05,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:05,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 17:42:05,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:42:05,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437665250] [2025-03-16 17:42:05,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437665250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:42:05,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:42:05,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:42:05,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875062965] [2025-03-16 17:42:05,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:42:05,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:42:05,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:42:05,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:42:05,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:42:05,763 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-16 17:42:05,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:42:05,780 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2025-03-16 17:42:05,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:42:05,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 24 [2025-03-16 17:42:05,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:42:05,783 INFO L225 Difference]: With dead ends: 49 [2025-03-16 17:42:05,784 INFO L226 Difference]: Without dead ends: 27 [2025-03-16 17:42:05,784 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-16 17:42:05,784 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:42:05,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:42:05,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-16 17:42:05,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-16 17:42:05,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 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-16 17:42:05,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2025-03-16 17:42:05,788 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 24 [2025-03-16 17:42:05,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:42:05,789 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-03-16 17:42:05,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-16 17:42:05,789 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2025-03-16 17:42:05,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-16 17:42:05,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:42:05,790 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:42:05,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 17:42:05,790 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:42:05,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:42:05,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1844215296, now seen corresponding path program 1 times [2025-03-16 17:42:05,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:42:05,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823264693] [2025-03-16 17:42:05,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:42:05,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:42:05,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 17:42:05,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 17:42:05,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:42:05,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:05,931 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 17:42:05,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:42:05,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823264693] [2025-03-16 17:42:05,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823264693] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:42:05,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074517058] [2025-03-16 17:42:05,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:42:05,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:42:05,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:42:05,934 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-16 17:42:05,935 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-16 17:42:06,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 17:42:06,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 17:42:06,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:42:06,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:06,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 17:42:06,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:42:06,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:42:06,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:42:06,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 17:42:06,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074517058] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:42:06,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:42:06,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-16 17:42:06,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088952912] [2025-03-16 17:42:06,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:42:06,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:42:06,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:42:06,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:42:06,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:42:06,165 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-16 17:42:06,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:42:06,185 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2025-03-16 17:42:06,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:42:06,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2025-03-16 17:42:06,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:42:06,186 INFO L225 Difference]: With dead ends: 46 [2025-03-16 17:42:06,186 INFO L226 Difference]: Without dead ends: 29 [2025-03-16 17:42:06,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:42:06,186 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:42:06,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 72 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:42:06,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-16 17:42:06,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-16 17:42:06,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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-16 17:42:06,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2025-03-16 17:42:06,191 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 24 [2025-03-16 17:42:06,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:42:06,191 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-03-16 17:42:06,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-16 17:42:06,191 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2025-03-16 17:42:06,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 17:42:06,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:42:06,191 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:42:06,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 17:42:06,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:42:06,392 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:42:06,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:42:06,393 INFO L85 PathProgramCache]: Analyzing trace with hash 5008383, now seen corresponding path program 1 times [2025-03-16 17:42:06,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:42:06,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512665373] [2025-03-16 17:42:06,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:42:06,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:42:06,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 17:42:06,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 17:42:06,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:42:06,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:06,946 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 17:42:06,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:42:06,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512665373] [2025-03-16 17:42:06,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512665373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:42:06,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:42:06,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 17:42:06,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890785270] [2025-03-16 17:42:06,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:42:06,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 17:42:06,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:42:06,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 17:42:06,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-16 17:42:06,949 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 17:42:07,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:42:07,102 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2025-03-16 17:42:07,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 17:42:07,102 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2025-03-16 17:42:07,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:42:07,103 INFO L225 Difference]: With dead ends: 39 [2025-03-16 17:42:07,103 INFO L226 Difference]: Without dead ends: 37 [2025-03-16 17:42:07,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-16 17:42:07,104 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:42:07,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 128 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:42:07,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-16 17:42:07,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2025-03-16 17:42:07,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 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-16 17:42:07,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2025-03-16 17:42:07,107 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 34 [2025-03-16 17:42:07,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:42:07,107 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2025-03-16 17:42:07,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 17:42:07,108 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2025-03-16 17:42:07,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 17:42:07,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:42:07,108 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:42:07,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 17:42:07,109 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:42:07,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:42:07,109 INFO L85 PathProgramCache]: Analyzing trace with hash 5009189, now seen corresponding path program 1 times [2025-03-16 17:42:07,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:42:07,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143104084] [2025-03-16 17:42:07,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:42:07,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:42:07,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 17:42:07,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 17:42:07,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:42:07,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:07,536 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 17:42:07,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:42:07,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143104084] [2025-03-16 17:42:07,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143104084] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:42:07,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844225801] [2025-03-16 17:42:07,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:42:07,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:42:07,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:42:07,539 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-16 17:42:07,541 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-16 17:42:07,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 17:42:07,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 17:42:07,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:42:07,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:07,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 17:42:07,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:42:07,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-16 17:42:07,826 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-16 17:42:07,828 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 17:42:07,829 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 17:42:07,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844225801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:42:07,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 17:42:07,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 20 [2025-03-16 17:42:07,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824943446] [2025-03-16 17:42:07,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:42:07,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 17:42:07,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:42:07,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 17:42:07,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2025-03-16 17:42:07,831 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 17:42:07,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:42:07,880 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2025-03-16 17:42:07,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 17:42:07,880 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2025-03-16 17:42:07,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:42:07,881 INFO L225 Difference]: With dead ends: 40 [2025-03-16 17:42:07,881 INFO L226 Difference]: Without dead ends: 37 [2025-03-16 17:42:07,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2025-03-16 17:42:07,882 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:42:07,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:42:07,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-16 17:42:07,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2025-03-16 17:42:07,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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-16 17:42:07,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-03-16 17:42:07,886 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 34 [2025-03-16 17:42:07,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:42:07,886 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-03-16 17:42:07,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 17:42:07,886 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-03-16 17:42:07,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 17:42:07,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:42:07,887 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:42:07,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 17:42:08,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:42:08,091 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:42:08,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:42:08,092 INFO L85 PathProgramCache]: Analyzing trace with hash 518162272, now seen corresponding path program 1 times [2025-03-16 17:42:08,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:42:08,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776686952] [2025-03-16 17:42:08,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:42:08,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:42:08,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 17:42:08,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 17:42:08,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:42:08,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:08,314 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-16 17:42:08,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:42:08,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776686952] [2025-03-16 17:42:08,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776686952] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:42:08,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318288370] [2025-03-16 17:42:08,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:42:08,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:42:08,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:42:08,316 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-16 17:42:08,318 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-16 17:42:08,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 17:42:08,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 17:42:08,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:42:08,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:08,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 135 conjuncts are in the unsatisfiable core [2025-03-16 17:42:08,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:42:08,480 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-16 17:42:08,511 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-16 17:42:08,584 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 26 treesize of output 11 [2025-03-16 17:42:08,777 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-16 17:42:08,778 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 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-16 17:42:08,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-16 17:42:08,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-16 17:42:08,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 17:42:08,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 17:42:08,930 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-16 17:42:08,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 75 [2025-03-16 17:42:08,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-16 17:42:08,942 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 39 treesize of output 15 [2025-03-16 17:42:09,147 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 45 treesize of output 21 [2025-03-16 17:42:09,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-16 17:42:09,156 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-16 17:42:09,160 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-16 17:42:13,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:42:13,867 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 53 treesize of output 36 [2025-03-16 17:42:13,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:42:13,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2025-03-16 17:42:13,939 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-16 17:42:13,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-16 17:42:13,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-16 17:42:14,423 INFO L349 Elim1Store]: treesize reduction 67, result has 29.5 percent of original size [2025-03-16 17:42:14,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 81 treesize of output 65 [2025-03-16 17:42:14,464 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-03-16 17:42:14,464 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 2 case distinctions, treesize of input 26 treesize of output 28 [2025-03-16 17:42:14,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:14,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 125 [2025-03-16 17:42:14,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:14,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 151 [2025-03-16 17:42:15,811 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 27 treesize of output 15 [2025-03-16 17:42:15,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-16 17:42:15,958 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:42:15,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:42:16,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318288370] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:42:16,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:42:16,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 25] total 32 [2025-03-16 17:42:16,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81659462] [2025-03-16 17:42:16,763 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:42:16,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-16 17:42:16,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:42:16,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-16 17:42:16,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1381, Unknown=1, NotChecked=0, Total=1482 [2025-03-16 17:42:16,764 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 32 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 26 states have internal predecessors, (53), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-16 17:42:20,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 17:42:29,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 17:42:35,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:42:35,157 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2025-03-16 17:42:35,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 17:42:35,158 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 26 states have internal predecessors, (53), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 36 [2025-03-16 17:42:35,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:42:35,159 INFO L225 Difference]: With dead ends: 60 [2025-03-16 17:42:35,159 INFO L226 Difference]: Without dead ends: 35 [2025-03-16 17:42:35,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=202, Invalid=2551, Unknown=3, NotChecked=0, Total=2756 [2025-03-16 17:42:35,161 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:42:35,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 406 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 605 Invalid, 2 Unknown, 0 Unchecked, 9.2s Time] [2025-03-16 17:42:35,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-16 17:42:35,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2025-03-16 17:42:35,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 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-16 17:42:35,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-03-16 17:42:35,164 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 36 [2025-03-16 17:42:35,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:42:35,165 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-03-16 17:42:35,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 26 states have internal predecessors, (53), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-16 17:42:35,165 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-03-16 17:42:35,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 17:42:35,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:42:35,166 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:42:35,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 17:42:35,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:42:35,367 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:42:35,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:42:35,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2063384983, now seen corresponding path program 1 times [2025-03-16 17:42:35,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:42:35,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662570937] [2025-03-16 17:42:35,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:42:35,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:42:35,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 17:42:35,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 17:42:35,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:42:35,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:37,288 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:42:37,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:42:37,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662570937] [2025-03-16 17:42:37,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662570937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:42:37,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615880761] [2025-03-16 17:42:37,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:42:37,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:42:37,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:42:37,290 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-16 17:42:37,290 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-16 17:42:37,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 17:42:37,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 17:42:37,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:42:37,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:37,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-03-16 17:42:37,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:42:37,562 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-16 17:42:38,052 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-16 17:42:38,052 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-16 17:42:38,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-03-16 17:42:38,293 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-16 17:42:38,668 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-16 17:42:38,676 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-16 17:42:39,026 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-03-16 17:42:39,027 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 20 treesize of output 22 [2025-03-16 17:42:39,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-16 17:42:39,531 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 36 treesize of output 34 [2025-03-16 17:42:39,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-16 17:42:39,654 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-16 17:42:39,823 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:42:39,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:42:44,048 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_829 Int) (v_ArrVal_830 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4) v_ArrVal_829))) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_830) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (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-16 17:42:48,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615880761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:42:48,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:42:48,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 45 [2025-03-16 17:42:48,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064476788] [2025-03-16 17:42:48,418 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:42:48,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-16 17:42:48,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:42:48,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-16 17:42:48,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2084, Unknown=17, NotChecked=92, Total=2352 [2025-03-16 17:42:48,420 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 45 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 35 states have internal predecessors, (57), 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-16 17:42:50,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:42:50,240 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2025-03-16 17:42:50,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-16 17:42:50,240 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 35 states have internal predecessors, (57), 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 37 [2025-03-16 17:42:50,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:42:50,241 INFO L225 Difference]: With dead ends: 50 [2025-03-16 17:42:50,241 INFO L226 Difference]: Without dead ends: 48 [2025-03-16 17:42:50,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=280, Invalid=3367, Unknown=17, NotChecked=118, Total=3782 [2025-03-16 17:42:50,243 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:42:50,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 244 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 17:42:50,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-16 17:42:50,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2025-03-16 17:42:50,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 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-16 17:42:50,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2025-03-16 17:42:50,252 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 37 [2025-03-16 17:42:50,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:42:50,252 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-03-16 17:42:50,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 35 states have internal predecessors, (57), 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-16 17:42:50,253 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2025-03-16 17:42:50,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 17:42:50,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:42:50,255 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:42:50,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 17:42:50,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:42:50,455 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:42:50,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:42:50,456 INFO L85 PathProgramCache]: Analyzing trace with hash 2063385789, now seen corresponding path program 1 times [2025-03-16 17:42:50,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:42:50,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310166935] [2025-03-16 17:42:50,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:42:50,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:42:50,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 17:42:50,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 17:42:50,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:42:50,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:50,707 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 17:42:50,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:42:50,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310166935] [2025-03-16 17:42:50,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310166935] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:42:50,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123579044] [2025-03-16 17:42:50,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:42:50,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:42:50,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:42:50,710 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-16 17:42:50,711 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-16 17:42:50,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 17:42:50,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 17:42:50,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:42:50,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:50,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-16 17:42:50,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:42:51,042 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-16 17:42:51,048 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 17:42:51,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:42:51,160 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 17:42:51,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123579044] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:42:51,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:42:51,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 10 [2025-03-16 17:42:51,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903397104] [2025-03-16 17:42:51,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:42:51,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 17:42:51,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:42:51,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 17:42:51,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 17:42:51,161 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 17:42:55,196 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-16 17:42:59,214 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-16 17:43:03,266 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-16 17:43:07,328 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-16 17:43:07,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:07,670 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2025-03-16 17:43:07,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 17:43:07,671 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2025-03-16 17:43:07,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:07,671 INFO L225 Difference]: With dead ends: 47 [2025-03-16 17:43:07,672 INFO L226 Difference]: Without dead ends: 44 [2025-03-16 17:43:07,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-16 17:43:07,672 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 26 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:07,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 156 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 4 Unknown, 0 Unchecked, 16.3s Time] [2025-03-16 17:43:07,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-16 17:43:07,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2025-03-16 17:43:07,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 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-16 17:43:07,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2025-03-16 17:43:07,677 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 37 [2025-03-16 17:43:07,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:07,677 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2025-03-16 17:43:07,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 17:43:07,677 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2025-03-16 17:43:07,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-16 17:43:07,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:07,678 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:07,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 17:43:07,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:07,882 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:07,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:07,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1361848584, now seen corresponding path program 1 times [2025-03-16 17:43:07,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:07,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98674607] [2025-03-16 17:43:07,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:07,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:07,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-16 17:43:07,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-16 17:43:07,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:07,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:09,270 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 17:43:09,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:09,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98674607] [2025-03-16 17:43:09,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98674607] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:09,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732378871] [2025-03-16 17:43:09,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:09,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:09,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:09,272 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-16 17:43:09,273 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-16 17:43:09,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-16 17:43:09,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-16 17:43:09,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:09,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:09,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 168 conjuncts are in the unsatisfiable core [2025-03-16 17:43:09,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:43:09,516 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-16 17:43:09,628 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 22 treesize of output 1 [2025-03-16 17:43:09,638 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 18 treesize of output 7 [2025-03-16 17:43:10,081 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 8 treesize of output 1 [2025-03-16 17:43:10,113 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-16 17:43:10,113 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-16 17:43:10,128 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-16 17:43:10,241 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-16 17:43:10,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-03-16 17:43:10,261 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 8 treesize of output 1 [2025-03-16 17:43:10,273 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-16 17:43:10,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 61 [2025-03-16 17:43:10,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-16 17:43:10,413 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 39 treesize of output 15 [2025-03-16 17:43:10,785 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 45 treesize of output 21 [2025-03-16 17:43:10,798 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-16 17:43:10,807 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-16 17:43:10,816 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 11 treesize of output 3 [2025-03-16 17:43:11,098 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 9 treesize of output 12 [2025-03-16 17:43:11,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:43:11,283 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 53 treesize of output 36 [2025-03-16 17:43:11,319 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-03-16 17:43:11,319 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 24 treesize of output 31 [2025-03-16 17:43:11,367 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-16 17:43:11,367 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-16 17:43:11,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-16 17:43:12,513 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2025-03-16 17:43:12,513 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 83 treesize of output 67 [2025-03-16 17:43:12,554 INFO L349 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2025-03-16 17:43:12,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 185 [2025-03-16 17:43:12,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 31 [2025-03-16 17:43:12,604 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2025-03-16 17:43:12,605 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 71 treesize of output 59 [2025-03-16 17:43:12,614 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 22 [2025-03-16 17:43:13,052 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 257 treesize of output 169 [2025-03-16 17:43:13,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:13,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 122 [2025-03-16 17:43:13,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:13,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 110 [2025-03-16 17:43:14,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:14,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 89 [2025-03-16 17:43:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:43:14,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:43:14,796 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1229 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1225 Int) (v_ArrVal_1228 Int)) (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 v_ArrVal_1225)))) (store .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8) v_ArrVal_1228))) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1222) .cse2) .cse3)) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1229) .cse2) .cse3))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2025-03-16 17:43:15,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:15,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 143 [2025-03-16 17:43:15,892 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_26| Int) (v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_1229 (Array Int Int)) (v_ArrVal_1239 (Array Int Int)) (v_ArrVal_1238 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1225 Int) (v_ArrVal_1228 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse0 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_26| v_ArrVal_1238) .cse2)) (.cse5 (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_26| v_ArrVal_1239) .cse2)) (.cse1 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_6 0) |c_ULTIMATE.start_dll_append_~data#1|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_26|) 0)) (not (= (select .cse0 .cse1) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.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|) 4))) (select (select (let ((.cse4 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_26| v_arrayElimArr_6))) (let ((.cse3 (store (select .cse4 .cse2) .cse1 v_ArrVal_1225))) (store (store |c_#memory_int#1| .cse2 .cse3) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_26| (store (select (store .cse4 .cse2 .cse3) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_26|) 8 v_ArrVal_1228)))) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse2 (store .cse5 .cse1 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_26|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_26| v_ArrVal_1222) .cse6) .cse7)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 (store .cse0 .cse1 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_26| v_ArrVal_1229) .cse6) .cse7)))) (not (= (select .cse5 .cse1) 0)))))) is different from false [2025-03-16 17:43:15,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732378871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:15,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:43:15,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 28] total 45 [2025-03-16 17:43:15,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068255772] [2025-03-16 17:43:15,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:43:15,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-16 17:43:15,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:15,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-16 17:43:15,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2592, Unknown=2, NotChecked=206, Total=2970 [2025-03-16 17:43:15,899 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 45 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 36 states have internal predecessors, (60), 6 states have call successors, (6), 5 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-16 17:43:19,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:19,401 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2025-03-16 17:43:19,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-16 17:43:19,401 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 36 states have internal predecessors, (60), 6 states have call successors, (6), 5 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 39 [2025-03-16 17:43:19,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:19,402 INFO L225 Difference]: With dead ends: 49 [2025-03-16 17:43:19,402 INFO L226 Difference]: Without dead ends: 40 [2025-03-16 17:43:19,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1095 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=300, Invalid=4262, Unknown=2, NotChecked=266, Total=4830 [2025-03-16 17:43:19,403 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:19,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 391 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 17:43:19,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-16 17:43:19,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2025-03-16 17:43:19,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 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-16 17:43:19,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2025-03-16 17:43:19,408 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 39 [2025-03-16 17:43:19,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:19,409 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2025-03-16 17:43:19,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 36 states have internal predecessors, (60), 6 states have call successors, (6), 5 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-16 17:43:19,409 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2025-03-16 17:43:19,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-16 17:43:19,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:19,409 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:19,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 17:43:19,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:19,610 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:19,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:19,610 INFO L85 PathProgramCache]: Analyzing trace with hash 670442072, now seen corresponding path program 1 times [2025-03-16 17:43:19,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:19,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816176793] [2025-03-16 17:43:19,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:19,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:19,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-16 17:43:19,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-16 17:43:19,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:19,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:21,813 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:43:21,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:21,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816176793] [2025-03-16 17:43:21,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816176793] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:21,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620174759] [2025-03-16 17:43:21,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:21,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:21,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:21,815 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:43:21,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 17:43:21,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-16 17:43:21,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-16 17:43:21,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:21,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:21,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 107 conjuncts are in the unsatisfiable core [2025-03-16 17:43:21,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:43:22,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-16 17:43:22,824 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-16 17:43:22,824 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-16 17:43:22,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-03-16 17:43:22,980 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-16 17:43:23,121 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-16 17:43:23,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-16 17:43:23,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-16 17:43:23,526 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 30 treesize of output 14 [2025-03-16 17:43:23,536 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-16 17:43:23,544 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-16 17:43:24,030 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-16 17:43:24,030 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-16 17:43:24,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:43:24,059 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 38 treesize of output 27 [2025-03-16 17:43:24,093 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-16 17:43:24,093 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-16 17:43:24,690 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 40 treesize of output 16 [2025-03-16 17:43:24,929 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 25 treesize of output 15 [2025-03-16 17:43:25,067 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-16 17:43:25,227 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:43:25,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:43:26,358 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1434 (Array Int Int)) (v_ArrVal_1433 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)) v_ArrVal_1433) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1434) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (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-16 17:43:26,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620174759] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:26,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:43:26,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 50 [2025-03-16 17:43:26,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928208179] [2025-03-16 17:43:26,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:43:26,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-16 17:43:26,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:26,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-16 17:43:26,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2645, Unknown=53, NotChecked=104, Total=2970 [2025-03-16 17:43:26,806 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 50 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 40 states have internal predecessors, (65), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 17:43:32,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:32,618 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2025-03-16 17:43:32,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-16 17:43:32,618 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 40 states have internal predecessors, (65), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2025-03-16 17:43:32,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:32,619 INFO L225 Difference]: With dead ends: 53 [2025-03-16 17:43:32,619 INFO L226 Difference]: Without dead ends: 51 [2025-03-16 17:43:32,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1251 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=361, Invalid=5138, Unknown=55, NotChecked=146, Total=5700 [2025-03-16 17:43:32,620 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 35 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:32,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 396 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-16 17:43:32,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-16 17:43:32,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2025-03-16 17:43:32,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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-16 17:43:32,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2025-03-16 17:43:32,625 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 39 [2025-03-16 17:43:32,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:32,625 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2025-03-16 17:43:32,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 40 states have internal predecessors, (65), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 17:43:32,625 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2025-03-16 17:43:32,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 17:43:32,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:32,625 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:32,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 17:43:32,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:32,827 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:32,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:32,828 INFO L85 PathProgramCache]: Analyzing trace with hash 49810297, now seen corresponding path program 1 times [2025-03-16 17:43:32,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:32,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230403148] [2025-03-16 17:43:32,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:32,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:32,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 17:43:32,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 17:43:32,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:32,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:36,616 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:43:36,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:36,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230403148] [2025-03-16 17:43:36,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230403148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:36,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180250949] [2025-03-16 17:43:36,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:36,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:36,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:36,618 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:43:36,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 17:43:36,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 17:43:36,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 17:43:36,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:36,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:36,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 143 conjuncts are in the unsatisfiable core [2025-03-16 17:43:36,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:43:37,045 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-16 17:43:37,380 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 18 treesize of output 7 [2025-03-16 17:43:37,859 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (or (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int#1_BEFORE_CALL_14| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_14| |c_#memory_int#1|))) (and (= .cse0 |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_14| .cse0 (select |c_#memory_int#1| .cse0))) (= (select (select |v_#memory_int#1_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2025-03-16 17:43:37,867 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (or (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int#1_BEFORE_CALL_14| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_14| |c_#memory_int#1|))) (and (= .cse0 |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_14| .cse0 (select |c_#memory_int#1| .cse0))) (= (select (select |v_#memory_int#1_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2025-03-16 17:43:37,914 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-16 17:43:37,956 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-16 17:43:37,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-16 17:43:37,995 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-16 17:43:38,010 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) is different from false [2025-03-16 17:43:38,015 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) is different from true [2025-03-16 17:43:38,059 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-16 17:43:38,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 75 [2025-03-16 17:43:38,086 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-03-16 17:43:38,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2025-03-16 17:43:38,118 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 47 treesize of output 23 [2025-03-16 17:43:38,137 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1))) (and (or .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) .cse0)))) is different from false [2025-03-16 17:43:38,142 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1))) (and (or .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) .cse0)))) is different from true [2025-03-16 17:43:38,198 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse0 (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= (select (select |c_#memory_int#1| .cse1) 0) 1)) (or .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2025-03-16 17:43:38,202 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse0 (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= (select (select |c_#memory_int#1| .cse1) 0) 1)) (or .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2025-03-16 17:43:38,269 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 ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse1 (= .cse0 .cse2))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse1) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) .cse1) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from false [2025-03-16 17:43:38,273 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 ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse1 (= .cse0 .cse2))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse1) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) .cse1) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from true [2025-03-16 17:43:38,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 40 [2025-03-16 17:43:38,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-16 17:43:38,304 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-16 17:43:38,345 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimCell_107 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_107) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_19| .cse1)))) (= (select |v_#valid_BEFORE_CALL_19| .cse0) 1)))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2025-03-16 17:43:38,349 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimCell_107 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_107) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_19| .cse1)))) (= (select |v_#valid_BEFORE_CALL_19| .cse0) 1)))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2025-03-16 17:43:38,394 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_107) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_19| .cse1)))) (= (select |v_#valid_BEFORE_CALL_19| .cse0) 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-16 17:43:38,398 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_107) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_19| .cse1)))) (= (select |v_#valid_BEFORE_CALL_19| .cse0) 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-16 17:43:38,484 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_107) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_19| .cse1)))) (= (select |v_#valid_BEFORE_CALL_19| .cse0) 1)))) (= |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-16 17:43:38,494 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_107) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_19| .cse1)))) (= (select |v_#valid_BEFORE_CALL_19| .cse0) 1)))) (= |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-16 17:43:38,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:43:38,586 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 80 treesize of output 57 [2025-03-16 17:43:38,643 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-03-16 17:43:38,644 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 40 treesize of output 47 [2025-03-16 17:43:38,771 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-16 17:43:38,771 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 36 treesize of output 39 [2025-03-16 17:43:38,810 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 ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse5 (= .cse4 .cse2))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_107) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_19| .cse1))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse3 (select |v_old(#valid)_AFTER_CALL_23| .cse3))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4) (= (select (select |c_#memory_int#1| .cse4) 0) 1) .cse5) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) .cse5) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from false [2025-03-16 17:43:38,816 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 ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse5 (= .cse4 .cse2))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_107) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_19| .cse1))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse3 (select |v_old(#valid)_AFTER_CALL_23| .cse3))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4) (= (select (select |c_#memory_int#1| .cse4) 0) 1) .cse5) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) .cse5) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from true [2025-03-16 17:43:38,949 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 (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse3 (= .cse5 .cse2))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_107) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_19| .cse1))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_23| .cse4))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_22| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse5) 0) 1) .cse3) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from false [2025-03-16 17:43:38,954 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 (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse3 (= .cse5 .cse2))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_107) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_19| .cse1))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_23| .cse4))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_22| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse5) 0) 1) .cse3) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from true [2025-03-16 17:43:39,067 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 ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (let ((.cse3 (= .cse5 .cse0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_107) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_19| .cse2))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_23| .cse4))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_22| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse5) 0) 1) .cse3) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0))))) is different from false [2025-03-16 17:43:39,072 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 ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (let ((.cse3 (= .cse5 .cse0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_107) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_19| .cse2))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_23| .cse4))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_22| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse5) 0) 1) .cse3) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0))))) is different from true [2025-03-16 17:43:39,286 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4)) (.cse5 (= .cse2 .cse4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_107) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_19| .cse1))))))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse3 0) (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse5) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse3) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse6 (select |v_old(#valid)_AFTER_CALL_23| .cse6))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse5))))) is different from false [2025-03-16 17:43:39,292 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4)) (.cse5 (= .cse2 .cse4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_107) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_19| .cse1))))))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse3 0) (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse5) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse3) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse6 (select |v_old(#valid)_AFTER_CALL_23| .cse6))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse5))))) is different from true [2025-03-16 17:43:39,560 INFO L349 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2025-03-16 17:43:39,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 115 [2025-03-16 17:43:39,571 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-16 17:43:39,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:43:39,616 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2025-03-16 17:43:39,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 208 treesize of output 133 [2025-03-16 17:43:39,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:43:39,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:43:39,633 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 123 treesize of output 85 [2025-03-16 17:43:39,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:43:39,654 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 74 treesize of output 68 [2025-03-16 17:43:39,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2025-03-16 17:43:39,731 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 ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) (= .cse0 .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_107) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse2) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_19| .cse3))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_23| .cse4))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 0)))))) is different from false [2025-03-16 17:43:39,736 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 ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) (= .cse0 .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_107) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse2) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_19| .cse3))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_23| .cse4))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 0)))))) is different from true [2025-03-16 17:43:39,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:39,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 67 [2025-03-16 17:43:39,837 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-16 17:43:39,837 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-16 17:43:39,851 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |c_#memory_int#1| .cse0) 0) 1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_23| .cse1))) |v_old(#valid)_AFTER_CALL_23|))))) is different from false [2025-03-16 17:43:39,855 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |c_#memory_int#1| .cse0) 0) 1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_23| .cse1))) |v_old(#valid)_AFTER_CALL_23|))))) is different from true [2025-03-16 17:43:39,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2025-03-16 17:43:39,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-16 17:43:39,969 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|)))) is different from false [2025-03-16 17:43:39,973 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|)))) is different from true [2025-03-16 17:43:40,075 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2025-03-16 17:43:40,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:43:40,391 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int))) (or (not (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 (select v_ArrVal_1648 .cse0))) v_ArrVal_1648)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1648) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1644) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1642) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1647) .cse1) .cse2)) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1643) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1646) .cse1) .cse2)))))) is different from false [2025-03-16 17:43:40,437 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse2))) (or (not (= (let ((.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse2) 4))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_1648 .cse1))) v_ArrVal_1648)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_1648) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1644) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1642) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1647) .cse3) .cse4)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1643) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1646) .cse3) .cse4)))))))) is different from false [2025-03-16 17:43:40,472 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse3))) (or (not (= v_ArrVal_1648 (let ((.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse3) 4))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_1648 .cse1))))) (= (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_1648) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1644) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1642) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1647) .cse4) .cse5)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1643) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1646) .cse4) .cse5))) |c_ULTIMATE.start_main_~data~0#1|))))) is different from false [2025-03-16 17:43:40,491 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse3))) (or (not (= v_ArrVal_1648 (let ((.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse3) 4))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_1648 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_1648) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1644) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1642) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1647) .cse4) .cse5)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1643) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1646) .cse4) .cse5)))))))) is different from false [2025-03-16 17:43:40,632 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1659 (Array Int Int)) (v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1658 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_34| Int) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1660 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_34| v_ArrVal_1660) .cse2) .cse3))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_34|) 0)) (not (= (let ((.cse1 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_34| v_ArrVal_1659) .cse2) .cse3) 4))) (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_34| v_ArrVal_1658) .cse0) .cse1 (select v_ArrVal_1648 .cse1))) v_ArrVal_1648)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_1648) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_34| v_ArrVal_1644) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1642) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_34| v_ArrVal_1647) .cse4) .cse5)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1643) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_34| v_ArrVal_1646) .cse4) .cse5)))))))) is different from false [2025-03-16 17:43:40,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180250949] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:40,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:43:40,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27] total 52 [2025-03-16 17:43:40,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462832735] [2025-03-16 17:43:40,635 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:43:40,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-16 17:43:40,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:40,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-16 17:43:40,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1454, Unknown=35, NotChecked=1900, Total=3540 [2025-03-16 17:43:40,637 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 52 states, 50 states have (on average 1.3) internal successors, (65), 42 states have internal predecessors, (65), 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-16 17:43:41,778 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0)) (.cse0 (= .cse3 1))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (or .cse0 (exists ((|v_#memory_int#1_BEFORE_CALL_14| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_14| |c_#memory_int#1|))) (and (= .cse1 |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_14| .cse1 (select |c_#memory_int#1| .cse1))) (= (select (select |v_#memory_int#1_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_create_~data#1| 1) (= .cse2 |c_ULTIMATE.start_dll_create_~data#1|) .cse0 (= |c_ULTIMATE.start_main_~data~0#1| .cse3) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))))) is different from false [2025-03-16 17:43:41,784 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0)) (.cse0 (= .cse3 1))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (or .cse0 (exists ((|v_#memory_int#1_BEFORE_CALL_14| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_14| |c_#memory_int#1|))) (and (= .cse1 |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_14| .cse1 (select |c_#memory_int#1| .cse1))) (= (select (select |v_#memory_int#1_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_create_~data#1| 1) (= .cse2 |c_ULTIMATE.start_dll_create_~data#1|) .cse0 (= |c_ULTIMATE.start_main_~data~0#1| .cse3) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))))) is different from true [2025-03-16 17:43:41,791 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) (or .cse2 (= .cse3 1)) (not .cse2) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse3) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))) is different from false [2025-03-16 17:43:41,797 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) (or .cse2 (= .cse3 1)) (not .cse2) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse3) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))) is different from true [2025-03-16 17:43:41,804 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (.cse1 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (.cse4 (select (select |c_#memory_int#1| .cse2) 0))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse3 (select |c_#valid| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse4 1) .cse0) (not (= .cse2 0)) .cse1 (= |c_ULTIMATE.start_main_~data~0#1| .cse4)))) is different from false [2025-03-16 17:43:41,811 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (.cse1 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (.cse4 (select (select |c_#memory_int#1| .cse2) 0))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse3 (select |c_#valid| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse4 1) .cse0) (not (= .cse2 0)) .cse1 (= |c_ULTIMATE.start_main_~data~0#1| .cse4)))) is different from true [2025-03-16 17:43:41,819 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse1 (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse2 (select (select |c_#memory_int#1| .cse0) 0)) (.cse3 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse1 (= .cse2 1)) (or .cse1 .cse3) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) .cse3 (not (= .cse0 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2025-03-16 17:43:41,826 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse1 (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse2 (select (select |c_#memory_int#1| .cse0) 0)) (.cse3 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse1 (= .cse2 1)) (or .cse1 .cse3) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) .cse3 (not (= .cse0 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2025-03-16 17:43:41,834 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (let ((.cse3 (= .cse2 .cse4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select |c_#valid| .cse1) 1) (or (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse3) (= (select |c_#valid| .cse4) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse5 (select |c_#valid| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 0))) (not (= .cse1 0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) .cse3) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 0)))))) is different from false [2025-03-16 17:43:41,840 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (let ((.cse3 (= .cse2 .cse4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select |c_#valid| .cse1) 1) (or (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse3) (= (select |c_#valid| .cse4) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse5 (select |c_#valid| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 0))) (not (= .cse1 0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) .cse3) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 0)))))) is different from true [2025-03-16 17:43:41,849 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_107) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_19| .cse1)))) (= (select |v_#valid_BEFORE_CALL_19| .cse0) 1)))) (= (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-16 17:43:41,854 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_107) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_19| .cse1)))) (= (select |v_#valid_BEFORE_CALL_19| .cse0) 1)))) (= (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-16 17:43:41,864 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#memory_int#1)| |c_#memory_int#1|)) (.cse5 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|)) (.cse1 (select |c_#memory_int#1| |c_node_create_#res#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_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| .cse1)) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| .cse2 (select |c_#memory_int#1| .cse2))) (or (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= .cse2 |c_node_create_#res#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_107) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse3) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_22| .cse4 (select |v_#valid_BEFORE_CALL_19| .cse4)))) (= (select |v_#valid_BEFORE_CALL_19| .cse3) 1)))) (= |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|))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse5) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse5 (select |c_#memory_$Pointer$#1.offset| .cse5))) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) (= |c_node_create_#in~data#1| (select .cse1 0)))) is different from false [2025-03-16 17:43:41,872 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#memory_int#1)| |c_#memory_int#1|)) (.cse5 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|)) (.cse1 (select |c_#memory_int#1| |c_node_create_#res#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_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| .cse1)) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| .cse2 (select |c_#memory_int#1| .cse2))) (or (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= .cse2 |c_node_create_#res#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_107) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse3) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_22| .cse4 (select |v_#valid_BEFORE_CALL_19| .cse4)))) (= (select |v_#valid_BEFORE_CALL_19| .cse3) 1)))) (= |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|))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse5) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse5 (select |c_#memory_$Pointer$#1.offset| .cse5))) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) (= |c_node_create_#in~data#1| (select .cse1 0)))) is different from true [2025-03-16 17:43:41,884 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (let ((.cse7 (= .cse6 .cse4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_107) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_19| .cse1))))))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (not (= .cse2 0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse5 (select |v_old(#valid)_AFTER_CALL_23| .cse5))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_22| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse6) (= (select (select |c_#memory_int#1| .cse6) 0) 1) .cse7) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4) .cse7) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse2) 0)))))) is different from false [2025-03-16 17:43:41,890 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (let ((.cse7 (= .cse6 .cse4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_107) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_19| .cse1))))))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (not (= .cse2 0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse5 (select |v_old(#valid)_AFTER_CALL_23| .cse5))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_22| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse6) (= (select (select |c_#memory_int#1| .cse6) 0) 1) .cse7) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4) .cse7) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse2) 0)))))) is different from true [2025-03-16 17:43:41,906 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (= .cse8 .cse5)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_107) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse2) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_19| .cse3))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (not (= .cse4 0)) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse6) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse5) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse7 (select |v_old(#valid)_AFTER_CALL_23| .cse7))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_22| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse5) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse8) 0) 1) .cse6) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse4) 0)))))) is different from false [2025-03-16 17:43:41,913 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (= .cse8 .cse5)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_107) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse2) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_19| .cse3))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (not (= .cse4 0)) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse6) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse5) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse7 (select |v_old(#valid)_AFTER_CALL_23| .cse7))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_22| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse5) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse8) 0) 1) .cse6) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse4) 0)))))) is different from true [2025-03-16 17:43:41,928 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse5 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse6 (= .cse8 .cse2))) (and (= (select .cse0 0) 0) (not (= .cse1 0)) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_107) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse3) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_19| .cse4))))))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse6) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse7 (select |v_old(#valid)_AFTER_CALL_23| .cse7))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_22| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse8) 0) 1) .cse6) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0)))))) is different from false [2025-03-16 17:43:41,935 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse5 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse6 (= .cse8 .cse2))) (and (= (select .cse0 0) 0) (not (= .cse1 0)) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_107) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse3) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_19| .cse4))))))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse6) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse7 (select |v_old(#valid)_AFTER_CALL_23| .cse7))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_22| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse8) 0) 1) .cse6) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0)))))) is different from true [2025-03-16 17:43:41,950 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse5 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse6 (= .cse8 .cse2))) (and (= (select .cse0 0) 0) (not (= .cse1 0)) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_107) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse3) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_19| .cse4))))))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse6) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse7 (select |v_old(#valid)_AFTER_CALL_23| .cse7))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_22| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse8) 0) 1) .cse6) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 0)))))) is different from false [2025-03-16 17:43:41,957 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse5 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse6 (= .cse8 .cse2))) (and (= (select .cse0 0) 0) (not (= .cse1 0)) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_107) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse3) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_19| .cse4))))))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse6) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse7 (select |v_old(#valid)_AFTER_CALL_23| .cse7))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_22| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse8) 0) 1) .cse6) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 0)))))) is different from true [2025-03-16 17:43:41,968 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select .cse3 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse8) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| .cse8) 4)) (.cse9 (= .cse6 .cse8))) (and (= (select .cse0 0) 0) (let ((.cse1 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1) 0)) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse2) 4)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0)) (not (= .cse1 0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0))))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_107) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse4) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_24| .cse5 (select |v_#valid_BEFORE_CALL_19| .cse5))))))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse7 0) (= .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse9) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse7) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse8) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse10 (select |v_old(#valid)_AFTER_CALL_23| .cse10))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_22| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse8) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse6) 0) 1) .cse9)))))) is different from false [2025-03-16 17:43:41,975 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select .cse3 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse8) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| .cse8) 4)) (.cse9 (= .cse6 .cse8))) (and (= (select .cse0 0) 0) (let ((.cse1 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1) 0)) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse2) 4)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0)) (not (= .cse1 0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0))))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_107) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse4) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_24| .cse5 (select |v_#valid_BEFORE_CALL_19| .cse5))))))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse7 0) (= .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse9) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse7) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse8) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse10 (select |v_old(#valid)_AFTER_CALL_23| .cse10))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_22| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse8) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse6) 0) 1) .cse9)))))) is different from true [2025-03-16 17:43:41,991 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse4 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse7) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4)) (.cse8 (= .cse5 .cse7))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_107) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_19| .cse2))))))) (or (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0)) (not (= (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0))) (not (= |c_ULTIMATE.start_dll_append_#t~mem10#1.base| 0))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse6 0) (= .cse7 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse8) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse6) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse7) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse9 (select |v_old(#valid)_AFTER_CALL_23| .cse9))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_22| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse7) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse5) 0) 1) .cse8)))))) is different from false [2025-03-16 17:43:41,998 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse4 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse7) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4)) (.cse8 (= .cse5 .cse7))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_107) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_19| .cse2))))))) (or (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0)) (not (= (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0))) (not (= |c_ULTIMATE.start_dll_append_#t~mem10#1.base| 0))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse6 0) (= .cse7 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse8) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse6) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse7) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse9 (select |v_old(#valid)_AFTER_CALL_23| .cse9))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_22| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse7) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse5) 0) 1) .cse8)))))) is different from true [2025-03-16 17:43:42,011 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse9 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4)) (.cse7 (= .cse4 .cse6)) (.cse1 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_107) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse2) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_19| .cse3))))))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse5 0) (= .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse7) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse5) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse6) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse8 (select |v_old(#valid)_AFTER_CALL_23| .cse8))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse6) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse4) 0) 1) .cse7) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0)) (not (= (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0)))))) is different from false [2025-03-16 17:43:42,018 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse9 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4)) (.cse7 (= .cse4 .cse6)) (.cse1 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_107) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse2) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_19| .cse3))))))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse5 0) (= .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse7) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse5) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse6) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse8 (select |v_old(#valid)_AFTER_CALL_23| .cse8))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse6) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse4) 0) 1) .cse7) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0)) (not (= (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0)))))) is different from true [2025-03-16 17:43:42,030 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 ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) (= .cse1 .cse2)) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_107) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse3) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_19| .cse4))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse6 (select |v_old(#valid)_AFTER_CALL_23| .cse6))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 0))))))) is different from false [2025-03-16 17:43:42,036 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 ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) (= .cse1 .cse2)) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_107) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse3) 0) (= |v_#valid_BEFORE_CALL_19| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_19| .cse4))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse6 (select |v_old(#valid)_AFTER_CALL_23| .cse6))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 0))))))) is different from true [2025-03-16 17:43:42,076 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_int#1| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= .cse1 1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse2 (select |v_old(#valid)_AFTER_CALL_23| .cse2))) |v_old(#valid)_AFTER_CALL_23|))) (= |c_ULTIMATE.start_main_~data~0#1| .cse1)))) is different from false [2025-03-16 17:43:42,082 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_int#1| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= .cse1 1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse2 (select |v_old(#valid)_AFTER_CALL_23| .cse2))) |v_old(#valid)_AFTER_CALL_23|))) (= |c_ULTIMATE.start_main_~data~0#1| .cse1)))) is different from true [2025-03-16 17:43:42,174 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= .cse0 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_23| .cse1))) |v_old(#valid)_AFTER_CALL_23|))))) is different from false [2025-03-16 17:43:42,179 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= .cse0 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_23| .cse1))) |v_old(#valid)_AFTER_CALL_23|))))) is different from true [2025-03-16 17:43:42,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:42,494 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2025-03-16 17:43:42,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-16 17:43:42,494 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 1.3) internal successors, (65), 42 states have internal predecessors, (65), 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 41 [2025-03-16 17:43:42,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:42,495 INFO L225 Difference]: With dead ends: 68 [2025-03-16 17:43:42,495 INFO L226 Difference]: Without dead ends: 66 [2025-03-16 17:43:42,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 37 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=215, Invalid=1844, Unknown=69, NotChecked=4514, Total=6642 [2025-03-16 17:43:42,496 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 2149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1726 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:42,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 395 Invalid, 2149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 419 Invalid, 0 Unknown, 1726 Unchecked, 1.0s Time] [2025-03-16 17:43:42,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-16 17:43:42,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2025-03-16 17:43:42,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 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-16 17:43:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2025-03-16 17:43:42,506 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 41 [2025-03-16 17:43:42,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:42,506 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2025-03-16 17:43:42,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 1.3) internal successors, (65), 42 states have internal predecessors, (65), 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-16 17:43:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2025-03-16 17:43:42,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 17:43:42,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:42,506 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:42,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 17:43:42,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-16 17:43:42,707 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:42,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:42,708 INFO L85 PathProgramCache]: Analyzing trace with hash 49811103, now seen corresponding path program 1 times [2025-03-16 17:43:42,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:42,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433580529] [2025-03-16 17:43:42,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:42,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:42,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 17:43:42,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 17:43:42,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:42,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat