./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_insert_unequal.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/dll2c_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:41:20,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:41:20,491 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:41:20,497 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:41:20,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:41:20,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:41:20,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:41:20,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:41:20,523 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:41:20,523 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:41:20,523 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:41:20,524 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:41:20,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:41:20,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:41:20,524 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:41:20,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:41:20,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:41:20,525 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:41:20,525 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:41:20,525 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:41:20,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:41:20,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:41:20,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:41:20,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:41:20,525 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:41:20,525 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:41:20,525 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:41:20,526 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:41:20,526 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:41:20,526 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:41:20,526 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:41:20,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:41:20,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:41:20,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:41:20,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:41:20,526 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:41:20,527 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:41:20,527 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:41:20,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:41:20,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:41:20,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:41:20,527 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:41:20,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:41:20,527 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 -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2025-03-16 17:41:20,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:41:20,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:41:20,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:41:20,762 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:41:20,762 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:41:20,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2025-03-16 17:41:21,877 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9e2c63f6/0770b3c0968f4c77b53d9e1d902acb49/FLAGf9542d214 [2025-03-16 17:41:22,166 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:41:22,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2025-03-16 17:41:22,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9e2c63f6/0770b3c0968f4c77b53d9e1d902acb49/FLAGf9542d214 [2025-03-16 17:41:22,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9e2c63f6/0770b3c0968f4c77b53d9e1d902acb49 [2025-03-16 17:41:22,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:41:22,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:41:22,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:41:22,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:41:22,193 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:41:22,194 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:41:22" (1/1) ... [2025-03-16 17:41:22,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eaa85da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:22, skipping insertion in model container [2025-03-16 17:41:22,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:41:22" (1/1) ... [2025-03-16 17:41:22,210 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:41:22,394 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2025-03-16 17:41:22,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:41:22,402 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:41:22,446 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2025-03-16 17:41:22,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:41:22,469 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:41:22,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:22 WrapperNode [2025-03-16 17:41:22,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:41:22,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:41:22,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:41:22,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:41:22,476 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:41:22" (1/1) ... [2025-03-16 17:41:22,488 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:41:22" (1/1) ... [2025-03-16 17:41:22,507 INFO L138 Inliner]: procedures = 127, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 176 [2025-03-16 17:41:22,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:41:22,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:41:22,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:41:22,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:41:22,513 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:22" (1/1) ... [2025-03-16 17:41:22,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:22" (1/1) ... [2025-03-16 17:41:22,518 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:22" (1/1) ... [2025-03-16 17:41:22,543 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 12, 26]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 18 writes are split as follows [0, 1, 17]. [2025-03-16 17:41:22,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:22" (1/1) ... [2025-03-16 17:41:22,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:22" (1/1) ... [2025-03-16 17:41:22,548 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:22" (1/1) ... [2025-03-16 17:41:22,549 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:22" (1/1) ... [2025-03-16 17:41:22,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:22" (1/1) ... [2025-03-16 17:41:22,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:22" (1/1) ... [2025-03-16 17:41:22,553 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:41:22,555 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:41:22,555 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:41:22,556 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:41:22,556 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:22" (1/1) ... [2025-03-16 17:41:22,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:41:22,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:41:22,579 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:41:22,585 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:41:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 17:41:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 17:41:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 17:41:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 17:41:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 17:41:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 17:41:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-16 17:41:22,597 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-16 17:41:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-16 17:41:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:41:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 17:41:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-16 17:41:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-16 17:41:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-16 17:41:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-16 17:41:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-16 17:41:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-16 17:41:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 17:41:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-16 17:41:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-16 17:41:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-16 17:41:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:41:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 17:41:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 17:41:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:41:22,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:41:22,692 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:41:22,693 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:41:22,873 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L642: 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:41:22,893 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:41:22,909 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2025-03-16 17:41:22,910 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:41:22,915 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:41:22,915 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:41:22,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:41:22 BoogieIcfgContainer [2025-03-16 17:41:22,916 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:41:22,917 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:41:22,917 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:41:22,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:41:22,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:41:22" (1/3) ... [2025-03-16 17:41:22,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69552bdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:41:22, skipping insertion in model container [2025-03-16 17:41:22,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:22" (2/3) ... [2025-03-16 17:41:22,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69552bdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:41:22, skipping insertion in model container [2025-03-16 17:41:22,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:41:22" (3/3) ... [2025-03-16 17:41:22,925 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2025-03-16 17:41:22,935 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:41:22,936 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_insert_unequal.i that has 2 procedures, 38 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-16 17:41:22,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:41:22,976 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;@72f16028, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:41:22,977 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 17:41:22,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 32 states have (on average 1.53125) internal successors, (49), 33 states have internal predecessors, (49), 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:41:22,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-16 17:41:22,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:41:22,983 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:41:22,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:41:22,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:41:22,987 INFO L85 PathProgramCache]: Analyzing trace with hash -720810114, now seen corresponding path program 1 times [2025-03-16 17:41:22,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:41:22,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094174108] [2025-03-16 17:41:22,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:41:22,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:41:23,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 17:41:23,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 17:41:23,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:41:23,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:41:23,383 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 17:41:23,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:41:23,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094174108] [2025-03-16 17:41:23,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094174108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:41:23,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:41:23,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:41:23,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136721804] [2025-03-16 17:41:23,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:41:23,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:41:23,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:41:23,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:41:23,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:41:23,405 INFO L87 Difference]: Start difference. First operand has 38 states, 32 states have (on average 1.53125) internal successors, (49), 33 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:41:23,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:41:23,436 INFO L93 Difference]: Finished difference Result 73 states and 106 transitions. [2025-03-16 17:41:23,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:41:23,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 22 [2025-03-16 17:41:23,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:41:23,441 INFO L225 Difference]: With dead ends: 73 [2025-03-16 17:41:23,441 INFO L226 Difference]: Without dead ends: 36 [2025-03-16 17:41:23,444 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:41:23,445 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 4 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:41:23,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 93 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:41:23,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-16 17:41:23,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2025-03-16 17:41:23,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 states have internal predecessors, (37), 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:41:23,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2025-03-16 17:41:23,467 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 22 [2025-03-16 17:41:23,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:41:23,468 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2025-03-16 17:41:23,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:41:23,468 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2025-03-16 17:41:23,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 17:41:23,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:41:23,469 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:41:23,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:41:23,470 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:41:23,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:41:23,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1404141471, now seen corresponding path program 1 times [2025-03-16 17:41:23,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:41:23,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958284784] [2025-03-16 17:41:23,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:41:23,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:41:23,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-16 17:41:23,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 17:41:23,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:41:23,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:41:23,586 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 17:41:23,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:41:23,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958284784] [2025-03-16 17:41:23,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958284784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:41:23,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:41:23,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:41:23,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533685110] [2025-03-16 17:41:23,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:41:23,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:41:23,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:41:23,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:41:23,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:41:23,588 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 17:41:23,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:41:23,611 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2025-03-16 17:41:23,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:41:23,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2025-03-16 17:41:23,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:41:23,613 INFO L225 Difference]: With dead ends: 46 [2025-03-16 17:41:23,613 INFO L226 Difference]: Without dead ends: 34 [2025-03-16 17:41:23,613 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:41:23,614 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:41:23,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:41:23,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-16 17:41:23,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-16 17:41:23,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 17:41:23,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2025-03-16 17:41:23,618 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 32 [2025-03-16 17:41:23,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:41:23,618 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2025-03-16 17:41:23,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 17:41:23,620 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2025-03-16 17:41:23,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 17:41:23,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:41:23,621 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:41:23,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 17:41:23,622 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:41:23,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:41:23,623 INFO L85 PathProgramCache]: Analyzing trace with hash -136029183, now seen corresponding path program 1 times [2025-03-16 17:41:23,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:41:23,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280180915] [2025-03-16 17:41:23,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:41:23,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:41:23,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 17:41:23,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 17:41:23,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:41:23,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:41:25,743 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:41:25,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:41:25,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280180915] [2025-03-16 17:41:25,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280180915] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:41:25,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502997662] [2025-03-16 17:41:25,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:41:25,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:41:25,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:41:25,746 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:41:25,748 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:41:25,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 17:41:26,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 17:41:26,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:41:26,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:41:26,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 131 conjuncts are in the unsatisfiable core [2025-03-16 17:41:26,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:41:26,339 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:41:26,538 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:41:26,613 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-16 17:41:26,613 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:41:26,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-16 17:41:26,680 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:41:26,759 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-16 17:41:26,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2025-03-16 17:41:26,767 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:41:26,917 INFO L349 Elim1Store]: treesize reduction 66, result has 14.3 percent of original size [2025-03-16 17:41:26,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 183 treesize of output 163 [2025-03-16 17:41:26,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:26,926 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 44 treesize of output 33 [2025-03-16 17:41:26,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 83 [2025-03-16 17:41:26,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2025-03-16 17:41:27,054 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-16 17:41:27,055 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 88 [2025-03-16 17:41:27,062 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 17 treesize of output 7 [2025-03-16 17:41:27,067 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:41:27,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-16 17:41:27,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:27,267 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-16 17:41:27,267 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 159 treesize of output 102 [2025-03-16 17:41:27,280 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-16 17:41:27,281 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:41:27,289 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:41:27,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2025-03-16 17:41:27,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 26 [2025-03-16 17:41:27,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2025-03-16 17:41:27,637 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:41:27,704 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:41:27,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:41:27,781 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_374 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (or (not (= v_ArrVal_374 (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_374 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_374) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_377) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_376) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) is different from false [2025-03-16 17:41:27,803 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_374 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (or (not (= v_ArrVal_374 (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select v_ArrVal_374 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_374) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_377) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) v_ArrVal_376) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) is different from false [2025-03-16 17:41:27,812 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_374 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (= v_ArrVal_374 (store (select |c_#memory_int#2| .cse0) .cse1 (select v_ArrVal_374 .cse1)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| .cse0 v_ArrVal_374) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_377) (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse1) v_ArrVal_376) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))) is different from false [2025-03-16 17:41:27,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502997662] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:41:27,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:41:27,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 44 [2025-03-16 17:41:27,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21884420] [2025-03-16 17:41:27,949 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:41:27,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-16 17:41:27,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:41:27,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-16 17:41:27,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2010, Unknown=4, NotChecked=276, Total=2450 [2025-03-16 17:41:27,953 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 44 states, 40 states have (on average 1.275) internal successors, (51), 34 states have internal predecessors, (51), 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:41:29,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:41:29,346 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2025-03-16 17:41:29,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-16 17:41:29,346 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 1.275) internal successors, (51), 34 states have internal predecessors, (51), 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 33 [2025-03-16 17:41:29,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:41:29,347 INFO L225 Difference]: With dead ends: 74 [2025-03-16 17:41:29,347 INFO L226 Difference]: Without dead ends: 72 [2025-03-16 17:41:29,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=288, Invalid=3502, Unknown=4, NotChecked=366, Total=4160 [2025-03-16 17:41:29,349 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 76 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 17:41:29,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 424 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 977 Invalid, 1 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 17:41:29,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-16 17:41:29,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2025-03-16 17:41:29,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 44 states have internal predecessors, (60), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 17:41:29,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 70 transitions. [2025-03-16 17:41:29,360 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 70 transitions. Word has length 33 [2025-03-16 17:41:29,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:41:29,360 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 70 transitions. [2025-03-16 17:41:29,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 1.275) internal successors, (51), 34 states have internal predecessors, (51), 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:41:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 70 transitions. [2025-03-16 17:41:29,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 17:41:29,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:41:29,361 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:41:29,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 17:41:29,561 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:41:29,562 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:41:29,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:41:29,562 INFO L85 PathProgramCache]: Analyzing trace with hash -636679201, now seen corresponding path program 2 times [2025-03-16 17:41:29,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:41:29,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79668811] [2025-03-16 17:41:29,562 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:41:29,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:41:29,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-16 17:41:29,593 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 17:41:29,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:41:29,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:41:29,681 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 17:41:29,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:41:29,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79668811] [2025-03-16 17:41:29,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79668811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:41:29,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:41:29,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:41:29,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186898954] [2025-03-16 17:41:29,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:41:29,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:41:29,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:41:29,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:41:29,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:41:29,682 INFO L87 Difference]: Start difference. First operand 52 states and 70 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 17:41:29,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:41:29,704 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2025-03-16 17:41:29,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:41:29,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2025-03-16 17:41:29,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:41:29,705 INFO L225 Difference]: With dead ends: 70 [2025-03-16 17:41:29,705 INFO L226 Difference]: Without dead ends: 54 [2025-03-16 17:41:29,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:41:29,706 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 25 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:41:29,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 117 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:41:29,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-16 17:41:29,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2025-03-16 17:41:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 17:41:29,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 68 transitions. [2025-03-16 17:41:29,711 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 68 transitions. Word has length 34 [2025-03-16 17:41:29,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:41:29,711 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 68 transitions. [2025-03-16 17:41:29,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 17:41:29,711 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2025-03-16 17:41:29,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 17:41:29,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:41:29,712 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:41:29,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 17:41:29,712 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:41:29,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:41:29,712 INFO L85 PathProgramCache]: Analyzing trace with hash 105034370, now seen corresponding path program 1 times [2025-03-16 17:41:29,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:41:29,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654155000] [2025-03-16 17:41:29,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:41:29,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:41:29,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 17:41:29,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 17:41:29,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:41:29,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:41:29,841 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 17:41:29,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:41:29,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654155000] [2025-03-16 17:41:29,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654155000] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:41:29,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473116417] [2025-03-16 17:41:29,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:41:29,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:41:29,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:41:29,843 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:41:29,845 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:41:29,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 17:41:29,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 17:41:29,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:41:29,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:41:29,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 17:41:29,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:41:30,006 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 17:41:30,006 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 17:41:30,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473116417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:41:30,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 17:41:30,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2025-03-16 17:41:30,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473765069] [2025-03-16 17:41:30,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:41:30,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:41:30,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:41:30,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:41:30,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:41:30,007 INFO L87 Difference]: Start difference. First operand 52 states and 68 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 17:41:30,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:41:30,026 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2025-03-16 17:41:30,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:41:30,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2025-03-16 17:41:30,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:41:30,027 INFO L225 Difference]: With dead ends: 68 [2025-03-16 17:41:30,027 INFO L226 Difference]: Without dead ends: 53 [2025-03-16 17:41:30,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:41:30,028 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 25 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 82 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:41:30,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 82 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:41:30,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-16 17:41:30,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2025-03-16 17:41:30,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 17:41:30,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2025-03-16 17:41:30,034 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 34 [2025-03-16 17:41:30,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:41:30,034 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2025-03-16 17:41:30,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 17:41:30,034 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2025-03-16 17:41:30,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 17:41:30,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:41:30,035 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:41:30,041 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:41:30,239 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:41:30,239 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:41:30,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:41:30,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1764752996, now seen corresponding path program 1 times [2025-03-16 17:41:30,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:41:30,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094241502] [2025-03-16 17:41:30,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:41:30,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:41:30,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 17:41:30,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 17:41:30,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:41:30,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:41:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 17:41:30,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:41:30,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094241502] [2025-03-16 17:41:30,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094241502] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:41:30,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121928465] [2025-03-16 17:41:30,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:41:30,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:41:30,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:41:30,333 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:41:30,335 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:41:30,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 17:41:30,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 17:41:30,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:41:30,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:41:30,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-16 17:41:30,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:41:30,486 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 17:41:30,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:41:30,545 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 17:41:30,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121928465] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:41:30,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:41:30,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-16 17:41:30,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065620498] [2025-03-16 17:41:30,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:41:30,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 17:41:30,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:41:30,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 17:41:30,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:41:30,547 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 17:41:30,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:41:30,621 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2025-03-16 17:41:30,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:41:30,621 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2025-03-16 17:41:30,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:41:30,622 INFO L225 Difference]: With dead ends: 64 [2025-03-16 17:41:30,622 INFO L226 Difference]: Without dead ends: 51 [2025-03-16 17:41:30,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-16 17:41:30,622 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:41:30,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 131 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:41:30,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-16 17:41:30,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-16 17:41:30,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 17:41:30,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2025-03-16 17:41:30,633 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 35 [2025-03-16 17:41:30,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:41:30,633 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2025-03-16 17:41:30,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 17:41:30,634 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2025-03-16 17:41:30,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 17:41:30,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:41:30,635 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:41:30,642 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:41:30,835 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:41:30,836 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:41:30,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:41:30,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1793382147, now seen corresponding path program 1 times [2025-03-16 17:41:30,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:41:30,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723324049] [2025-03-16 17:41:30,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:41:30,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:41:30,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 17:41:30,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 17:41:30,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:41:30,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:41:30,998 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 17:41:30,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:41:30,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723324049] [2025-03-16 17:41:30,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723324049] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:41:30,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663442766] [2025-03-16 17:41:30,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:41:30,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:41:30,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:41:31,000 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:41:31,002 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:41:31,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 17:41:31,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 17:41:31,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:41:31,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:41:31,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-16 17:41:31,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:41:31,196 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:41:31,216 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:41:31,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:41:31,249 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 17:41:31,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663442766] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:41:31,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:41:31,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 14 [2025-03-16 17:41:31,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432816484] [2025-03-16 17:41:31,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:41:31,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 17:41:31,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:41:31,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 17:41:31,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-16 17:41:31,250 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-16 17:41:35,269 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:41:39,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 17:41:43,297 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:41:47,438 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:41:51,454 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:41:51,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:41:51,461 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2025-03-16 17:41:51,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 17:41:51,465 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2025-03-16 17:41:51,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:41:51,469 INFO L225 Difference]: With dead ends: 83 [2025-03-16 17:41:51,469 INFO L226 Difference]: Without dead ends: 54 [2025-03-16 17:41:51,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-16 17:41:51,470 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 23 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:41:51,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 309 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2025-03-16 17:41:51,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-16 17:41:51,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-16 17:41:51,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 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:41:51,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2025-03-16 17:41:51,479 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 35 [2025-03-16 17:41:51,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:41:51,480 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2025-03-16 17:41:51,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-16 17:41:51,480 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2025-03-16 17:41:51,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 17:41:51,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:41:51,480 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:41:51,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 17:41:51,681 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:41:51,682 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:41:51,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:41:51,683 INFO L85 PathProgramCache]: Analyzing trace with hash 2006447532, now seen corresponding path program 1 times [2025-03-16 17:41:51,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:41:51,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098056896] [2025-03-16 17:41:51,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:41:51,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:41:51,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 17:41:51,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 17:41:51,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:41:51,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:41:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:41:53,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:41:53,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098056896] [2025-03-16 17:41:53,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098056896] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:41:53,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688933892] [2025-03-16 17:41:53,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:41:53,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:41:53,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:41:53,333 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:41:53,334 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:41:53,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 17:41:53,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 17:41:53,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:41:53,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:41:53,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 135 conjuncts are in the unsatisfiable core [2025-03-16 17:41:53,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:41:53,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-16 17:41:53,958 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from false [2025-03-16 17:41:53,960 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from true [2025-03-16 17:41:53,976 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:41:53,982 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from false [2025-03-16 17:41:53,984 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from true [2025-03-16 17:41:54,002 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-16 17:41:54,002 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:41:54,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-16 17:41:54,025 WARN L851 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) is different from false [2025-03-16 17:41:54,027 WARN L873 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) is different from true [2025-03-16 17:41:54,045 WARN L851 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from false [2025-03-16 17:41:54,047 WARN L873 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from true [2025-03-16 17:41:54,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:54,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:54,067 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 50 treesize of output 39 [2025-03-16 17:41:54,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2025-03-16 17:41:54,091 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select |c_#valid| .cse0) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) is different from false [2025-03-16 17:41:54,092 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select |c_#valid| .cse0) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) is different from true [2025-03-16 17:41:54,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2025-03-16 17:41:54,117 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1))))) is different from false [2025-03-16 17:41:54,119 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1))))) is different from true [2025-03-16 17:41:54,143 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1))))) is different from false [2025-03-16 17:41:54,144 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1))))) is different from true [2025-03-16 17:41:54,190 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:41:54,195 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 8) |c_node_create_#in~data#1|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1))))) is different from false [2025-03-16 17:41:54,196 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 8) |c_node_create_#in~data#1|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1))))) is different from true [2025-03-16 17:41:54,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:54,243 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 22 treesize of output 17 [2025-03-16 17:41:54,277 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_16| (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1))))) is different from false [2025-03-16 17:41:54,279 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_16| (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1))))) is different from true [2025-03-16 17:41:54,324 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= 1 (select |v_old(#valid)_AFTER_CALL_16| (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1)))))) is different from false [2025-03-16 17:41:54,327 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= 1 (select |v_old(#valid)_AFTER_CALL_16| (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1)))))) is different from true [2025-03-16 17:41:54,376 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= 1 (select |v_old(#valid)_AFTER_CALL_16| (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1)))))) is different from false [2025-03-16 17:41:54,378 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= 1 (select |v_old(#valid)_AFTER_CALL_16| (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1)))))) is different from true [2025-03-16 17:41:54,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:54,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:54,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:54,453 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 50 treesize of output 26 [2025-03-16 17:41:54,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2025-03-16 17:41:54,465 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 0 case distinctions, treesize of input 100 treesize of output 47 [2025-03-16 17:41:54,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:54,480 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2025-03-16 17:41:54,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 70 [2025-03-16 17:41:54,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:54,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:54,487 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 41 treesize of output 15 [2025-03-16 17:41:54,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 19 [2025-03-16 17:41:54,509 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 0 case distinctions, treesize of input 183 treesize of output 90 [2025-03-16 17:41:54,514 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-16 17:41:54,518 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 0 case distinctions, treesize of input 169 treesize of output 76 [2025-03-16 17:41:54,525 INFO L349 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2025-03-16 17:41:54,525 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 145 treesize of output 87 [2025-03-16 17:41:54,528 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-16 17:41:54,553 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (= (select (select |c_#memory_int#2| .cse0) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_34 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= 1 (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_34)) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1))))))) is different from false [2025-03-16 17:41:54,556 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (= (select (select |c_#memory_int#2| .cse0) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_34 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= 1 (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_34)) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1))))))) is different from true [2025-03-16 17:41:54,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:41:54,578 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 83 treesize of output 59 [2025-03-16 17:41:54,666 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| .cse0) 8)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 0) (or (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (v_arrayElimCell_31 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0))) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_34 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_34)))))) is different from false [2025-03-16 17:41:54,668 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| .cse0) 8)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 0) (or (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (v_arrayElimCell_31 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0))) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_34 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_34)))))) is different from true [2025-03-16 17:41:54,724 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 28 treesize of output 16 [2025-03-16 17:41:54,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:41:54,739 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 56 treesize of output 68 [2025-03-16 17:41:54,745 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:41:54,786 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_34 Int)) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_15| .cse0))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1) (= 1 (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_34)) (= (select |v_old(#valid)_AFTER_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0)))) is different from false [2025-03-16 17:41:54,787 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_34 Int)) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_15| .cse0))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1) (= 1 (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_34)) (= (select |v_old(#valid)_AFTER_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0)))) is different from true [2025-03-16 17:41:54,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-16 17:41:54,806 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2025-03-16 17:41:54,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:41:54,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:41:54,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 84 [2025-03-16 17:41:54,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:41:54,876 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 320 treesize of output 323 [2025-03-16 17:41:54,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 146 [2025-03-16 17:41:54,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 294 treesize of output 282 [2025-03-16 17:41:55,303 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (= .cse8 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse17 (not .cse10)) (.cse6 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4)) (.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse9 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse22 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse8))) (let ((.cse0 (or (and (forall ((v_ArrVal_1273 Int) (v_ArrVal_1275 Int) (v_arrayElimCell_49 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse34 (select (store (let ((.cse35 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1272))) (store .cse35 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse35 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1271) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1270) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 (+ 8 v_arrayElimCell_49))) (forall ((v_arrayElimCell_52 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 (+ 8 v_arrayElimCell_52))))))) (or (forall ((v_ArrVal_1273 Int) (v_ArrVal_1275 Int) (v_arrayElimCell_49 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse36 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1272))) (store .cse36 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse36 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1271) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1270) .cse8) .cse9)) (+ 8 v_arrayElimCell_49)))) .cse10)) .cse22)) (.cse1 (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1275 Int) (v_arrayElimCell_49 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse32 (select (store (let ((.cse33 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1272))) (store .cse33 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse33 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1271) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1270) .cse8) .cse9)))) (or (forall ((v_arrayElimCell_51 Int)) (= (select .cse32 (+ 8 v_arrayElimCell_51)) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 (+ 8 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 (+ 8 v_arrayElimCell_49))))))) (.cse2 (or .cse17 (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1275 Int) (v_arrayElimCell_49 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse30 (select (store (let ((.cse31 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1272))) (store .cse31 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse31 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1271) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1270) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 (+ 8 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 (+ 8 v_arrayElimCell_49)))))))) (.cse3 (or .cse10 (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1275 Int) (v_arrayElimCell_49 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse28 (select (store (let ((.cse29 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1272))) (store .cse29 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse29 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1271) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1270) .cse8) .cse9)))) (or (= (select .cse28 (+ 8 v_arrayElimCell_51)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (+ 8 v_arrayElimCell_49)))))))) (.cse4 (not .cse22)) (.cse13 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8))) (and (or (and .cse0 .cse1 .cse2 .cse3 (or .cse4 (let ((.cse5 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (and (or (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1272) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse5 .cse6 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1271) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1270) .cse8) .cse9)) (+ 8 v_arrayElimCell_51)))) .cse10) (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1272) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse5 .cse6 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1271) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1270) .cse8) .cse9)))) (or (forall ((v_arrayElimCell_51 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 (+ 8 v_arrayElimCell_51)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 (+ 8 v_arrayElimCell_52)))))))))) (= .cse8 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (or (and .cse0 .cse1 .cse2 .cse3) (= .cse9 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)) (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse12 (select (store (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1272))) (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1271) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1270) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 .cse13)) (forall ((v_arrayElimCell_51 Int)) (= (select .cse12 (+ 8 v_arrayElimCell_51)) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 (+ 8 v_arrayElimCell_52)))))) (or (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse15 (select (store (let ((.cse16 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1272))) (store .cse16 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse16 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1271) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1270) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 .cse13)) (= (select .cse15 (+ 8 v_arrayElimCell_51)) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse10) (or .cse17 (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse18 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1272))) (store .cse18 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse18 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1271) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1270) .cse8) .cse9)) (+ 8 v_arrayElimCell_52))))) (or (and (or (forall ((v_ArrVal_1273 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse19 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1272))) (store .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1271) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1270) .cse8) .cse9)) .cse13))) .cse10) (forall ((v_ArrVal_1273 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse20 (select (store (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1272))) (store .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1271) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1270) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 .cse13)) (forall ((v_arrayElimCell_52 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 (+ 8 v_arrayElimCell_52)))))))) .cse22) (or (and (or .cse10 (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (= (select (select (store (let ((.cse23 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1272))) (store .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1271) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1270) .cse8) .cse9)) (+ 8 v_arrayElimCell_51)) |c_ULTIMATE.start_main_~uneq~0#1|))) (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse24 (select (store (let ((.cse25 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1272))) (store .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1271) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1270) .cse8) .cse9)))) (or (forall ((v_arrayElimCell_51 Int)) (= (select .cse24 (+ 8 v_arrayElimCell_51)) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 (+ 8 v_arrayElimCell_52))))))) .cse4) (or .cse17 (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse26 (select (store (let ((.cse27 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1272))) (store .cse27 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse27 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1271) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1270) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 .cse13)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 (+ 8 v_arrayElimCell_52)))))))))))) is different from false [2025-03-16 17:41:55,887 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse38 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse9 (select .cse38 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse11 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse13 (= .cse9 .cse11))) (let ((.cse17 (not .cse13)) (.cse14 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse11)) (.cse8 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4)) (.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse38 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8)) (.cse0 (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1275 Int) (v_arrayElimCell_49 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse36 (select (store (let ((.cse37 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272))) (store .cse37 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse37 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273))) .cse9 v_ArrVal_1271) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) .cse9 v_ArrVal_1270) .cse11) .cse4)))) (or (forall ((v_arrayElimCell_51 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse36 (+ 8 v_arrayElimCell_51)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse36 (+ 8 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse36 (+ 8 v_arrayElimCell_49))))))) (.cse1 (or .cse14 (and (forall ((v_ArrVal_1273 Int) (v_ArrVal_1275 Int) (v_arrayElimCell_49 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse33 (select (store (let ((.cse34 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272))) (store .cse34 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse34 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273))) .cse9 v_ArrVal_1271) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) .cse9 v_ArrVal_1270) .cse11) .cse4)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse33 (+ 8 v_arrayElimCell_49))) (forall ((v_arrayElimCell_52 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse33 (+ 8 v_arrayElimCell_52))))))) (or (forall ((v_ArrVal_1273 Int) (v_ArrVal_1275 Int) (v_arrayElimCell_49 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse35 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272))) (store .cse35 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse35 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273))) .cse9 v_ArrVal_1271) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) .cse9 v_ArrVal_1270) .cse11) .cse4)) (+ 8 v_arrayElimCell_49)))) .cse13)))) (.cse22 (not .cse14)) (.cse2 (or (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1275 Int) (v_arrayElimCell_49 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse31 (select (store (let ((.cse32 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272))) (store .cse32 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse32 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273))) .cse9 v_ArrVal_1271) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) .cse9 v_ArrVal_1270) .cse11) .cse4)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 (+ 8 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 (+ 8 v_arrayElimCell_49)))))) .cse17)) (.cse3 (or (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1275 Int) (v_arrayElimCell_49 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse29 (select (store (let ((.cse30 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272))) (store .cse30 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse30 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273))) .cse9 v_ArrVal_1271) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) .cse9 v_ArrVal_1270) .cse11) .cse4)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 (+ 8 v_arrayElimCell_51))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 (+ 8 v_arrayElimCell_49)))))) .cse13))) (and (or (and .cse0 .cse1 .cse2 .cse3) (= .cse4 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (or (and (forall ((v_ArrVal_1273 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse5 (select (store (let ((.cse7 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272))) (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273))) .cse9 v_ArrVal_1271) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) .cse9 v_ArrVal_1270) .cse11) .cse4)))) (or (forall ((v_arrayElimCell_52 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse5 (+ 8 v_arrayElimCell_52)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse5 .cse6))))) (or (forall ((v_ArrVal_1273 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse12 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272))) (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273))) .cse9 v_ArrVal_1271) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) .cse9 v_ArrVal_1270) .cse11) .cse4)) .cse6))) .cse13)) .cse14) (or (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse15 (select (store (let ((.cse16 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272))) (store .cse16 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse16 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273))) .cse9 v_ArrVal_1271) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) .cse9 v_ArrVal_1270) .cse11) .cse4)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 (+ 8 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 .cse6))))) .cse17) (or (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse18 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272))) (store .cse18 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse18 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273))) .cse9 v_ArrVal_1271) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) .cse9 v_ArrVal_1270) .cse11) .cse4)) (+ 8 v_arrayElimCell_52)))) .cse17) (or (and (or .cse13 (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse19 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272))) (store .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273))) .cse9 v_ArrVal_1271) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) .cse9 v_ArrVal_1270) .cse11) .cse4)) (+ 8 v_arrayElimCell_51))))) (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse20 (select (store (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272))) (store .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273))) .cse9 v_ArrVal_1271) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) .cse9 v_ArrVal_1270) .cse11) .cse4)))) (or (forall ((v_arrayElimCell_51 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 (+ 8 v_arrayElimCell_51)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 (+ 8 v_arrayElimCell_52))))))) .cse22) (or (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse23 (select (store (let ((.cse24 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272))) (store .cse24 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse24 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273))) .cse9 v_ArrVal_1271) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) .cse9 v_ArrVal_1270) .cse11) .cse4)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 (+ 8 v_arrayElimCell_51))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 .cse6))))) .cse13) (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse25 (select (store (let ((.cse26 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272))) (store .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273))) .cse9 v_ArrVal_1271) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) .cse9 v_ArrVal_1270) .cse11) .cse4)))) (or (forall ((v_arrayElimCell_51 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 (+ 8 v_arrayElimCell_51)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 (+ 8 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 .cse6))))) (or (= .cse11 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (and .cse0 .cse1 (or (let ((.cse28 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (and (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse27 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse28 .cse8 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273)) .cse9 v_ArrVal_1271) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) .cse9 v_ArrVal_1270) .cse11) .cse4)))) (or (forall ((v_arrayElimCell_51 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 (+ 8 v_arrayElimCell_51)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 (+ 8 v_arrayElimCell_52)))))) (or (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse28 .cse8 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1273)) .cse9 v_ArrVal_1271) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1263) .cse9 v_ArrVal_1270) .cse11) .cse4)) (+ 8 v_arrayElimCell_51)))) .cse13))) .cse22) .cse2 .cse3)))))))) is different from false [2025-03-16 17:41:56,175 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse40 (select |c_#memory_$Pointer$#2.base| .cse10)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse11 (select .cse40 .cse5)) (.cse13 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse15 (= .cse11 .cse13))) (let ((.cse23 (= .cse13 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (.cse19 (not .cse15)) (.cse9 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 4)) (.cse12 (store |c_#memory_$Pointer$#2.base| .cse10 (store .cse40 .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (or .cse19 (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1275 Int) (v_arrayElimCell_49 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse38 (select (store (let ((.cse39 (store |c_#memory_int#2| .cse10 v_ArrVal_1272))) (store .cse39 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse39 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse9 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1273))) .cse11 v_ArrVal_1271) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1263) .cse11 v_ArrVal_1270) .cse13) .cse4)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse38 (+ 8 v_arrayElimCell_52))) (= (select .cse38 (+ 8 v_arrayElimCell_49)) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (.cse1 (or .cse23 (and (or (forall ((v_ArrVal_1273 Int) (v_ArrVal_1275 Int) (v_arrayElimCell_49 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (= (select (select (store (let ((.cse35 (store |c_#memory_int#2| .cse10 v_ArrVal_1272))) (store .cse35 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse35 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse9 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1273))) .cse11 v_ArrVal_1271) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1263) .cse11 v_ArrVal_1270) .cse13) .cse4)) (+ 8 v_arrayElimCell_49)) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse15) (forall ((v_ArrVal_1273 Int) (v_ArrVal_1275 Int) (v_arrayElimCell_49 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse36 (select (store (let ((.cse37 (store |c_#memory_int#2| .cse10 v_ArrVal_1272))) (store .cse37 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse37 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse9 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1273))) .cse11 v_ArrVal_1271) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1263) .cse11 v_ArrVal_1270) .cse13) .cse4)))) (or (= (select .cse36 (+ 8 v_arrayElimCell_49)) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_52 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse36 (+ 8 v_arrayElimCell_52)))))))))) (.cse2 (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1275 Int) (v_arrayElimCell_49 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse33 (select (store (let ((.cse34 (store |c_#memory_int#2| .cse10 v_ArrVal_1272))) (store .cse34 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse34 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse9 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1273))) .cse11 v_ArrVal_1271) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1263) .cse11 v_ArrVal_1270) .cse13) .cse4)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse33 (+ 8 v_arrayElimCell_52))) (= (select .cse33 (+ 8 v_arrayElimCell_49)) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_51 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse33 (+ 8 v_arrayElimCell_51)))))))) (.cse6 (not .cse23)) (.cse3 (or .cse15 (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1275 Int) (v_arrayElimCell_49 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse31 (select (store (let ((.cse32 (store |c_#memory_int#2| .cse10 v_ArrVal_1272))) (store .cse32 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse32 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse9 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1273))) .cse11 v_ArrVal_1271) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1263) .cse11 v_ArrVal_1270) .cse13) .cse4)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 (+ 8 v_arrayElimCell_51))) (= (select .cse31 (+ 8 v_arrayElimCell_49)) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (.cse17 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 8))) (and (or (and .cse0 .cse1 .cse2 .cse3) (= .cse4 .cse5)) (or .cse6 (and (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse7 (select (store (let ((.cse8 (store |c_#memory_int#2| .cse10 v_ArrVal_1272))) (store .cse8 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse8 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse9 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1273))) .cse11 v_ArrVal_1271) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1263) .cse11 v_ArrVal_1270) .cse13) .cse4)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse7 (+ 8 v_arrayElimCell_52))) (forall ((v_arrayElimCell_51 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse7 (+ 8 v_arrayElimCell_51))))))) (or (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse14 (store |c_#memory_int#2| .cse10 v_ArrVal_1272))) (store .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse9 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1273))) .cse11 v_ArrVal_1271) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1263) .cse11 v_ArrVal_1270) .cse13) .cse4)) (+ 8 v_arrayElimCell_51)))) .cse15))) (or (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse16 (select (store (let ((.cse18 (store |c_#memory_int#2| .cse10 v_ArrVal_1272))) (store .cse18 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse18 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse9 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1273))) .cse11 v_ArrVal_1271) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1263) .cse11 v_ArrVal_1270) .cse13) .cse4)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 (+ 8 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 .cse17))))) .cse19) (or (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse20 (store |c_#memory_int#2| .cse10 v_ArrVal_1272))) (store .cse20 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse9 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1273))) .cse11 v_ArrVal_1271) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1263) .cse11 v_ArrVal_1270) .cse13) .cse4)) (+ 8 v_arrayElimCell_52)))) .cse19) (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int#2| .cse10 v_ArrVal_1272))) (store .cse22 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse9 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1273))) .cse11 v_ArrVal_1271) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1263) .cse11 v_ArrVal_1270) .cse13) .cse4)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 (+ 8 v_arrayElimCell_52))) (forall ((v_arrayElimCell_51 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 (+ 8 v_arrayElimCell_51)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 .cse17))))) (or .cse23 (and (forall ((v_ArrVal_1273 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse24 (select (store (let ((.cse25 (store |c_#memory_int#2| .cse10 v_ArrVal_1272))) (store .cse25 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse25 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse9 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1273))) .cse11 v_ArrVal_1271) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1263) .cse11 v_ArrVal_1270) .cse13) .cse4)))) (or (forall ((v_arrayElimCell_52 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 (+ 8 v_arrayElimCell_52)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 .cse17))))) (or (forall ((v_ArrVal_1273 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse26 (store |c_#memory_int#2| .cse10 v_ArrVal_1272))) (store .cse26 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse26 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse9 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1273))) .cse11 v_ArrVal_1271) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1263) .cse11 v_ArrVal_1270) .cse13) .cse4)) .cse17))) .cse15))) (or (= .cse10 .cse13) (and .cse0 .cse1 .cse2 (or (let ((.cse27 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (and (or (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#2| .cse10 v_ArrVal_1272) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store .cse27 .cse9 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1273)) .cse11 v_ArrVal_1271) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1263) .cse11 v_ArrVal_1270) .cse13) .cse4)) (+ 8 v_arrayElimCell_51)))) .cse15) (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse28 (select (store (store (store |c_#memory_int#2| .cse10 v_ArrVal_1272) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store .cse27 .cse9 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1273)) .cse11 v_ArrVal_1271) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1263) .cse11 v_ArrVal_1270) .cse13) .cse4)))) (or (forall ((v_arrayElimCell_51 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (+ 8 v_arrayElimCell_51)))) (= (select .cse28 (+ 8 v_arrayElimCell_52)) |c_ULTIMATE.start_main_~uneq~0#1|)))))) .cse6) .cse3)) (or (forall ((v_ArrVal_1273 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse29 (select (store (let ((.cse30 (store |c_#memory_int#2| .cse10 v_ArrVal_1272))) (store .cse30 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse30 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse9 v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1273))) .cse11 v_ArrVal_1271) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1263) .cse11 v_ArrVal_1270) .cse13) .cse4)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 (+ 8 v_arrayElimCell_51))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 .cse17))))) .cse15)))))))) is different from false [2025-03-16 17:42:09,559 WARN L286 SmtUtils]: Spent 13.08s on a formula simplification. DAG size of input: 1171 DAG size of output: 351 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-03-16 17:42:09,559 INFO L349 Elim1Store]: treesize reduction 25300, result has 12.9 percent of original size [2025-03-16 17:42:09,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 21 select indices, 21 select index equivalence classes, 0 disjoint index pairs (out of 210 index pairs), introduced 22 new quantified variables, introduced 232 case distinctions, treesize of input 174995 treesize of output 167939 [2025-03-16 17:42:10,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:10,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38089 treesize of output 38090 [2025-03-16 17:42:10,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:10,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38081 treesize of output 38058 [2025-03-16 17:42:10,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38049 treesize of output 38045 [2025-03-16 17:42:10,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38045 treesize of output 38029 [2025-03-16 17:42:12,027 INFO L224 Elim1Store]: Index analysis took 828 ms [2025-03-16 17:42:18,679 WARN L286 SmtUtils]: Spent 6.65s on a formula simplification that was a NOOP. DAG size: 1004 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-03-16 17:42:18,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:18,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 21 select indices, 21 select index equivalence classes, 0 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 210 case distinctions, treesize of input 42051 treesize of output 64833 [2025-03-16 17:42:20,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:20,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39923 treesize of output 39900 [2025-03-16 17:42:21,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:21,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40155 treesize of output 40124 [2025-03-16 17:42:22,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:22,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40477 treesize of output 40442 [2025-03-16 17:42:24,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:24,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39907 treesize of output 39884 [2025-03-16 17:42:25,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:25,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39859 treesize of output 39836 [2025-03-16 17:42:26,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:26,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40151 treesize of output 40128 [2025-03-16 17:42:27,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:27,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39915 treesize of output 39892 [2025-03-16 17:42:29,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39973 treesize of output 39961 [2025-03-16 17:42:30,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39927 treesize of output 39911 [2025-03-16 17:42:31,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:31,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39911 treesize of output 39888 [2025-03-16 17:42:32,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:32,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39969 treesize of output 39960 [2025-03-16 17:42:34,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:34,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40007 treesize of output 39998 [2025-03-16 17:42:36,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40045 treesize of output 40033 [2025-03-16 17:42:37,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:37,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40233 treesize of output 40216 [2025-03-16 17:42:39,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:39,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40037 treesize of output 40022 [2025-03-16 17:42:41,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:41,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40481 treesize of output 40460 [2025-03-16 17:42:42,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:42,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40095 treesize of output 40080 [2025-03-16 17:42:44,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:44,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40071 treesize of output 40056 [2025-03-16 17:42:45,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40031 treesize of output 40015 [2025-03-16 17:42:47,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:47,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40015 treesize of output 40000 [2025-03-16 17:42:49,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:49,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40315 treesize of output 40292 [2025-03-16 17:42:51,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:51,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40079 treesize of output 40056 [2025-03-16 17:42:52,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40137 treesize of output 40125 [2025-03-16 17:42:55,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40091 treesize of output 40075 [2025-03-16 17:42:56,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:56,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40255 treesize of output 40240 [2025-03-16 17:42:58,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:58,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40343 treesize of output 40328 [2025-03-16 17:43:01,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:01,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40953 treesize of output 40918