./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-simple/sll2c_append_equal.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/list-simple/sll2c_append_equal.c -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 b48f044428959e3ab1841a1f7785a165aa6a81be54b4ff3ea4de4b9579942c4f --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:55:57,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:55:57,070 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-29 10:55:57,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:55:57,075 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:55:57,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:55:57,098 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:55:57,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:55:57,099 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:55:57,100 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:55:57,100 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:55:57,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:55:57,101 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:55:57,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:55:57,101 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:55:57,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:55:57,101 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:55:57,102 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:55:57,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:55:57,102 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:55:57,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:55:57,102 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:55:57,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:55:57,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:55:57,102 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:55:57,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:55:57,102 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:55:57,102 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:55:57,102 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:55:57,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:55:57,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:55:57,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:55:57,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:55:57,103 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:55:57,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:55:57,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:55:57,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:55:57,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:55:57,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:55:57,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:55:57,104 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:55:57,104 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:55:57,104 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:55:57,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:55:57,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:55:57,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:55:57,104 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:55:57,104 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 -> b48f044428959e3ab1841a1f7785a165aa6a81be54b4ff3ea4de4b9579942c4f [2025-04-29 10:55:57,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:55:57,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:55:57,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:55:57,332 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:55:57,333 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:55:57,334 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_append_equal.c [2025-04-29 10:55:58,599 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddc543bdb/c5845ca1f96d472a9cbde50c0a7f4f68/FLAG4f7ed3088 [2025-04-29 10:55:58,829 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:55:58,829 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_append_equal.c [2025-04-29 10:55:58,830 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:55:58,830 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:55:58,839 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddc543bdb/c5845ca1f96d472a9cbde50c0a7f4f68/FLAG4f7ed3088 [2025-04-29 10:55:59,649 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddc543bdb/c5845ca1f96d472a9cbde50c0a7f4f68 [2025-04-29 10:55:59,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:55:59,652 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:55:59,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:55:59,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:55:59,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:55:59,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:55:59" (1/1) ... [2025-04-29 10:55:59,657 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e8a9871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:59, skipping insertion in model container [2025-04-29 10:55:59,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:55:59" (1/1) ... [2025-04-29 10:55:59,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:55:59,840 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_append_equal.c[1616,1629] [2025-04-29 10:55:59,844 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:55:59,852 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:55:59,881 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_append_equal.c[1616,1629] [2025-04-29 10:55:59,885 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:55:59,894 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:55:59,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:59 WrapperNode [2025-04-29 10:55:59,894 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:55:59,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:55:59,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:55:59,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:55:59,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:59" (1/1) ... [2025-04-29 10:55:59,907 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:59" (1/1) ... [2025-04-29 10:55:59,922 INFO L138 Inliner]: procedures = 18, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 127 [2025-04-29 10:55:59,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:55:59,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:55:59,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:55:59,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:55:59,930 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:59" (1/1) ... [2025-04-29 10:55:59,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:59" (1/1) ... [2025-04-29 10:55:59,932 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:59" (1/1) ... [2025-04-29 10:55:59,956 INFO L175 MemorySlicer]: Split 22 memory accesses to 2 slices as follows [13, 9]. 59 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [0, 1]. The 8 writes are split as follows [7, 1]. [2025-04-29 10:55:59,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:59" (1/1) ... [2025-04-29 10:55:59,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:59" (1/1) ... [2025-04-29 10:55:59,961 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:59" (1/1) ... [2025-04-29 10:55:59,961 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:59" (1/1) ... [2025-04-29 10:55:59,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:59" (1/1) ... [2025-04-29 10:55:59,965 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:59" (1/1) ... [2025-04-29 10:55:59,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:59" (1/1) ... [2025-04-29 10:55:59,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:55:59,977 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:55:59,977 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:55:59,977 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:55:59,978 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:59" (1/1) ... [2025-04-29 10:55:59,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:55:59,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:55:59,999 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-04-29 10:56:00,000 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-04-29 10:56:00,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 10:56:00,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 10:56:00,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 10:56:00,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 10:56:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 10:56:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 10:56:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 10:56:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 10:56:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 10:56:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 10:56:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:56:00,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:56:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 10:56:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 10:56:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-29 10:56:00,017 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-29 10:56:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 10:56:00,079 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:56:00,080 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:56:00,234 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-04-29 10:56:00,234 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:56:00,243 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:56:00,245 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-29 10:56:00,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:56:00 BoogieIcfgContainer [2025-04-29 10:56:00,246 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:56:00,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:56:00,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:56:00,251 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:56:00,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:55:59" (1/3) ... [2025-04-29 10:56:00,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@242dc3b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:56:00, skipping insertion in model container [2025-04-29 10:56:00,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:59" (2/3) ... [2025-04-29 10:56:00,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@242dc3b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:56:00, skipping insertion in model container [2025-04-29 10:56:00,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:56:00" (3/3) ... [2025-04-29 10:56:00,255 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.c [2025-04-29 10:56:00,264 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:56:00,265 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_append_equal.c that has 2 procedures, 34 locations, 49 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-29 10:56:00,304 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:56:00,313 INFO L340 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;@191fbaec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:56:00,315 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-29 10:56:00,318 INFO L278 IsEmpty]: Start isEmpty. Operand has 34 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:00,322 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 10:56:00,322 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:00,322 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:00,323 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:00,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:00,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1458028568, now seen corresponding path program 1 times [2025-04-29 10:56:00,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:00,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690057111] [2025-04-29 10:56:00,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:00,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:00,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 10:56:00,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 10:56:00,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:00,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:00,495 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:56:00,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:00,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690057111] [2025-04-29 10:56:00,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690057111] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:00,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:56:00,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 10:56:00,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566931300] [2025-04-29 10:56:00,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:00,503 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-29 10:56:00,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:00,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-29 10:56:00,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 10:56:00,519 INFO L87 Difference]: Start difference. First operand has 34 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:00,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:00,536 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2025-04-29 10:56:00,536 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-29 10:56:00,537 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-04-29 10:56:00,539 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:00,543 INFO L225 Difference]: With dead ends: 48 [2025-04-29 10:56:00,543 INFO L226 Difference]: Without dead ends: 27 [2025-04-29 10:56:00,545 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 10:56:00,549 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:00,551 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:00,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-04-29 10:56:00,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-04-29 10:56:00,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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-04-29 10:56:00,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2025-04-29 10:56:00,572 INFO L79 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 23 [2025-04-29 10:56:00,573 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:00,573 INFO L485 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2025-04-29 10:56:00,573 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:00,573 INFO L278 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2025-04-29 10:56:00,574 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 10:56:00,574 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:00,574 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:00,574 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:56:00,575 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:00,575 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:00,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1458041495, now seen corresponding path program 1 times [2025-04-29 10:56:00,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:00,575 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42847880] [2025-04-29 10:56:00,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:00,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:00,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 10:56:00,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 10:56:00,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:00,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:56:00,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:00,742 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42847880] [2025-04-29 10:56:00,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42847880] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:00,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:56:00,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:56:00,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122760156] [2025-04-29 10:56:00,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:00,743 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:56:00,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:00,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:56:00,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:56:00,743 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:00,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:00,762 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2025-04-29 10:56:00,763 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:56:00,763 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2025-04-29 10:56:00,764 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:00,765 INFO L225 Difference]: With dead ends: 48 [2025-04-29 10:56:00,765 INFO L226 Difference]: Without dead ends: 28 [2025-04-29 10:56:00,765 INFO L436 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-04-29 10:56:00,765 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:00,766 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:00,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-04-29 10:56:00,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-04-29 10:56:00,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:00,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-04-29 10:56:00,773 INFO L79 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2025-04-29 10:56:00,773 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:00,773 INFO L485 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-04-29 10:56:00,773 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:00,773 INFO L278 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2025-04-29 10:56:00,774 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-29 10:56:00,774 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:00,775 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] [2025-04-29 10:56:00,775 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 10:56:00,775 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:00,775 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:00,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1383922991, now seen corresponding path program 1 times [2025-04-29 10:56:00,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:00,776 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977222117] [2025-04-29 10:56:00,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:00,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:00,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 10:56:00,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 10:56:00,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:00,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:56:01,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:01,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977222117] [2025-04-29 10:56:01,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977222117] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:01,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650091000] [2025-04-29 10:56:01,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:01,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:01,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:01,125 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-04-29 10:56:01,127 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-04-29 10:56:01,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 10:56:01,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 10:56:01,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:01,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:01,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-29 10:56:01,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:01,381 INFO L354 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-04-29 10:56:01,394 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:56:01,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:01,445 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:56:01,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650091000] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:56:01,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:56:01,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 12 [2025-04-29 10:56:01,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037347969] [2025-04-29 10:56:01,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:01,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 10:56:01,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:01,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 10:56:01,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-04-29 10:56:01,447 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 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-04-29 10:56:05,466 WARN L532 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-04-29 10:56:09,489 WARN L532 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-04-29 10:56:13,502 WARN L532 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-04-29 10:56:17,605 WARN L532 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-04-29 10:56:17,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:17,606 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2025-04-29 10:56:17,607 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 10:56:17,608 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 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 31 [2025-04-29 10:56:17,608 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:17,608 INFO L225 Difference]: With dead ends: 42 [2025-04-29 10:56:17,608 INFO L226 Difference]: Without dead ends: 35 [2025-04-29 10:56:17,609 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-04-29 10:56:17,609 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 22 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:17,609 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 197 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2025-04-29 10:56:17,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-04-29 10:56:17,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-04-29 10:56:17,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:17,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2025-04-29 10:56:17,615 INFO L79 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 31 [2025-04-29 10:56:17,616 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:17,616 INFO L485 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2025-04-29 10:56:17,616 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 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-04-29 10:56:17,616 INFO L278 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2025-04-29 10:56:17,616 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 10:56:17,616 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:17,616 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-04-29 10:56:17,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 10:56:17,818 WARN L466 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-04-29 10:56:17,819 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:17,820 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:17,820 INFO L85 PathProgramCache]: Analyzing trace with hash -873694894, now seen corresponding path program 1 times [2025-04-29 10:56:17,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:17,820 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549668516] [2025-04-29 10:56:17,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:17,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:17,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 10:56:17,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 10:56:17,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:17,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:18,772 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:18,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:18,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549668516] [2025-04-29 10:56:18,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549668516] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:18,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818761271] [2025-04-29 10:56:18,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:18,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:18,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:18,794 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-04-29 10:56:18,795 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-04-29 10:56:18,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 10:56:19,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 10:56:19,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:19,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:19,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 92 conjuncts are in the unsatisfiable core [2025-04-29 10:56:19,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:19,049 INFO L354 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-04-29 10:56:19,170 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 10:56:19,236 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:56:19,236 INFO L354 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-04-29 10:56:19,296 INFO L354 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 25 treesize of output 13 [2025-04-29 10:56:19,358 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 10:56:19,503 INFO L354 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 17 treesize of output 3 [2025-04-29 10:56:19,506 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 10:56:19,614 INFO L325 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-04-29 10:56:19,614 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-04-29 10:56:19,621 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-04-29 10:56:19,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:19,799 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2025-04-29 10:56:19,805 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-04-29 10:56:19,851 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-04-29 10:56:19,855 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-04-29 10:56:19,920 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:19,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:21,948 WARN L849 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_13| Int) (v_ArrVal_348 Int) (v_ArrVal_346 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (store |c_#memory_int#0| .cse0 (store (select |c_#memory_int#0| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_13| v_ArrVal_348))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_346) (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|) 4))) (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_13|))) is different from false [2025-04-29 10:56:22,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818761271] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:22,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:56:22,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 37 [2025-04-29 10:56:22,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756279259] [2025-04-29 10:56:22,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:22,168 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-29 10:56:22,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:22,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-29 10:56:22,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1668, Unknown=28, NotChecked=82, Total=1892 [2025-04-29 10:56:22,170 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 37 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 29 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:56:23,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:23,090 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2025-04-29 10:56:23,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 10:56:23,091 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 29 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2025-04-29 10:56:23,091 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:23,091 INFO L225 Difference]: With dead ends: 46 [2025-04-29 10:56:23,092 INFO L226 Difference]: Without dead ends: 38 [2025-04-29 10:56:23,093 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=232, Invalid=2824, Unknown=28, NotChecked=108, Total=3192 [2025-04-29 10:56:23,093 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 33 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:23,093 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 346 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 10:56:23,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-29 10:56:23,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2025-04-29 10:56:23,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:23,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2025-04-29 10:56:23,097 INFO L79 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 34 [2025-04-29 10:56:23,097 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:23,098 INFO L485 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2025-04-29 10:56:23,098 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 29 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:56:23,098 INFO L278 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2025-04-29 10:56:23,098 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-29 10:56:23,098 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:23,098 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:23,106 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-04-29 10:56:23,299 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-29 10:56:23,299 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:23,299 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:23,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1190263797, now seen corresponding path program 1 times [2025-04-29 10:56:23,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:23,300 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108184076] [2025-04-29 10:56:23,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:23,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:23,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 10:56:23,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 10:56:23,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:23,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:24,658 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:24,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:24,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108184076] [2025-04-29 10:56:24,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108184076] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:24,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955830631] [2025-04-29 10:56:24,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:24,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:24,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:24,661 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-04-29 10:56:24,662 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-04-29 10:56:24,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 10:56:24,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 10:56:24,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:24,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:24,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 132 conjuncts are in the unsatisfiable core [2025-04-29 10:56:24,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:24,857 INFO L354 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-04-29 10:56:25,022 INFO L354 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-04-29 10:56:25,105 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:56:25,105 INFO L354 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-04-29 10:56:25,163 INFO L354 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-04-29 10:56:25,170 INFO L354 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-04-29 10:56:25,176 INFO L354 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-04-29 10:56:25,289 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 10:56:25,289 INFO L354 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 66 treesize of output 57 [2025-04-29 10:56:25,298 INFO L354 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-04-29 10:56:25,304 INFO L354 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-04-29 10:56:25,429 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-29 10:56:25,434 INFO L354 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-04-29 10:56:25,438 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 10:56:25,442 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-04-29 10:56:25,638 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-29 10:56:25,639 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-04-29 10:56:25,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:25,655 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2025-04-29 10:56:25,668 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-29 10:56:25,668 INFO L354 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-04-29 10:56:25,680 INFO L354 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-04-29 10:56:26,015 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:56:26,015 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:56:26,016 INFO L354 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 27 treesize of output 7 [2025-04-29 10:56:26,109 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:26,110 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2025-04-29 10:56:26,267 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2025-04-29 10:56:26,274 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-04-29 10:56:26,336 INFO L354 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-04-29 10:56:26,407 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:26,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:27,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955830631] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:27,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:56:27,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 47 [2025-04-29 10:56:27,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68036286] [2025-04-29 10:56:27,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:27,027 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-04-29 10:56:27,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:27,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-04-29 10:56:27,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2863, Unknown=21, NotChecked=0, Total=3080 [2025-04-29 10:56:27,029 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 47 states, 43 states have (on average 1.302325581395349) internal successors, (56), 38 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:56:28,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:28,573 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2025-04-29 10:56:28,573 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-29 10:56:28,573 INFO L79 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 1.302325581395349) internal successors, (56), 38 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2025-04-29 10:56:28,574 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:28,575 INFO L225 Difference]: With dead ends: 70 [2025-04-29 10:56:28,575 INFO L226 Difference]: Without dead ends: 68 [2025-04-29 10:56:28,577 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1567 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=490, Invalid=6131, Unknown=21, NotChecked=0, Total=6642 [2025-04-29 10:56:28,577 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 117 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:28,578 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 280 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-29 10:56:28,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-04-29 10:56:28,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 42. [2025-04-29 10:56:28,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:28,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-04-29 10:56:28,584 INFO L79 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 37 [2025-04-29 10:56:28,584 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:28,584 INFO L485 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-04-29 10:56:28,584 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 1.302325581395349) internal successors, (56), 38 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:56:28,584 INFO L278 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-04-29 10:56:28,585 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-29 10:56:28,585 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:28,585 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:28,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 10:56:28,785 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:28,785 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:28,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:28,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1382246604, now seen corresponding path program 1 times [2025-04-29 10:56:28,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:28,786 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399665498] [2025-04-29 10:56:28,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:28,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:28,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 10:56:28,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 10:56:28,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:28,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:30,031 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:56:30,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:30,031 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399665498] [2025-04-29 10:56:30,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399665498] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:30,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475802792] [2025-04-29 10:56:30,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:30,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:30,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:30,034 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-04-29 10:56:30,035 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-04-29 10:56:30,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 10:56:30,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 10:56:30,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:30,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:30,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-04-29 10:56:30,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:30,152 INFO L354 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-04-29 10:56:30,242 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:56:30,242 INFO L354 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-04-29 10:56:30,273 INFO L354 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-04-29 10:56:30,309 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 10:56:30,309 INFO L354 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 34 treesize of output 33 [2025-04-29 10:56:30,369 INFO L354 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 38 treesize of output 14 [2025-04-29 10:56:30,372 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 10:56:30,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:30,459 INFO L354 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 46 treesize of output 35 [2025-04-29 10:56:30,473 INFO L325 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-04-29 10:56:30,473 INFO L354 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 32 treesize of output 34 [2025-04-29 10:56:30,570 INFO L325 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2025-04-29 10:56:30,571 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 59 [2025-04-29 10:56:30,585 INFO L325 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2025-04-29 10:56:30,585 INFO L354 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 3 case distinctions, treesize of input 68 treesize of output 74 [2025-04-29 10:56:30,616 INFO L354 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 29 treesize of output 25 [2025-04-29 10:56:30,642 INFO L354 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 20 [2025-04-29 10:56:30,670 INFO L354 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 35 treesize of output 19 [2025-04-29 10:56:30,671 INFO L354 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-04-29 10:56:30,687 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 10:56:30,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:30,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475802792] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:30,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:56:30,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 36 [2025-04-29 10:56:30,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349817834] [2025-04-29 10:56:30,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:30,887 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-29 10:56:30,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:30,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-29 10:56:30,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1430, Unknown=18, NotChecked=0, Total=1560 [2025-04-29 10:56:30,888 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 36 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 29 states have internal predecessors, (57), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-29 10:56:31,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:31,718 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2025-04-29 10:56:31,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-29 10:56:31,719 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 29 states have internal predecessors, (57), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 39 [2025-04-29 10:56:31,719 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:31,720 INFO L225 Difference]: With dead ends: 93 [2025-04-29 10:56:31,720 INFO L226 Difference]: Without dead ends: 90 [2025-04-29 10:56:31,721 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=312, Invalid=3575, Unknown=19, NotChecked=0, Total=3906 [2025-04-29 10:56:31,721 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 102 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:31,722 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 344 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 10:56:31,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-04-29 10:56:31,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 45. [2025-04-29 10:56:31,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2025-04-29 10:56:31,728 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 39 [2025-04-29 10:56:31,729 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:31,729 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2025-04-29 10:56:31,729 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 29 states have internal predecessors, (57), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-29 10:56:31,729 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2025-04-29 10:56:31,729 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-29 10:56:31,729 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:31,729 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:31,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 10:56:31,930 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:31,930 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:31,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:31,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1831817842, now seen corresponding path program 2 times [2025-04-29 10:56:31,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:31,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255861131] [2025-04-29 10:56:31,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:56:31,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:31,941 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-29 10:56:31,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 10:56:31,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:56:31,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:32,928 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:32,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:32,929 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255861131] [2025-04-29 10:56:32,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255861131] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:32,929 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654773845] [2025-04-29 10:56:32,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:56:32,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:32,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:32,931 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-04-29 10:56:32,932 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-04-29 10:56:32,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-29 10:56:33,211 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 10:56:33,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:56:33,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:33,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 134 conjuncts are in the unsatisfiable core [2025-04-29 10:56:33,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:33,234 INFO L354 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-04-29 10:56:33,335 WARN L849 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret2#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |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_sll_circular_create_#t~ret2#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= 0 |c_ULTIMATE.start_sll_circular_create_#t~ret2#1.offset|)) is different from false [2025-04-29 10:56:33,338 WARN L871 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret2#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |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_sll_circular_create_#t~ret2#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= 0 |c_ULTIMATE.start_sll_circular_create_#t~ret2#1.offset|)) is different from true [2025-04-29 10:56:33,355 INFO L354 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-04-29 10:56:33,358 INFO L354 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-04-29 10:56:33,362 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |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)))) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0)) is different from false [2025-04-29 10:56:33,364 WARN L871 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |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)))) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0)) is different from true [2025-04-29 10:56:33,386 INFO L325 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-04-29 10:56:33,386 INFO L354 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 48 treesize of output 34 [2025-04-29 10:56:33,407 INFO L325 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-04-29 10:56:33,407 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2025-04-29 10:56:33,418 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse0) 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 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| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1))) (= (select (select |c_#memory_$Pointer$#0.base| .cse0) 0) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) 0))) is different from false [2025-04-29 10:56:33,420 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse0) 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 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| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1))) (= (select (select |c_#memory_$Pointer$#0.base| .cse0) 0) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) 0))) is different from true [2025-04-29 10:56:33,450 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| .cse0) 0))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0))) (= (select (select |c_#memory_$Pointer$#0.base| .cse1) 0) .cse0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |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) (= (select (select |c_#memory_$Pointer$#0.offset| .cse1) 0) 0)))) is different from false [2025-04-29 10:56:33,452 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| .cse0) 0))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0))) (= (select (select |c_#memory_$Pointer$#0.base| .cse1) 0) .cse0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |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) (= (select (select |c_#memory_$Pointer$#0.offset| .cse1) 0) 0)))) is different from true [2025-04-29 10:56:33,467 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-29 10:56:33,467 INFO L354 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 48 treesize of output 23 [2025-04-29 10:56:33,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:33,475 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-29 10:56:33,490 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#0.offset| |c_old(#memory_$Pointer$#0.offset)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_5) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (= |c_old(#memory_$Pointer$#0.base)| |c_#memory_$Pointer$#0.base|)) is different from false [2025-04-29 10:56:33,492 WARN L871 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#0.offset| |c_old(#memory_$Pointer$#0.offset)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_5) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (= |c_old(#memory_$Pointer$#0.base)| |c_#memory_$Pointer$#0.base|)) is different from true [2025-04-29 10:56:33,517 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#0.offset| |c_old(#memory_$Pointer$#0.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_5) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#0.base)| |c_#memory_$Pointer$#0.base|)) is different from false [2025-04-29 10:56:33,519 WARN L871 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#0.offset| |c_old(#memory_$Pointer$#0.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_5) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#0.base)| |c_#memory_$Pointer$#0.base|)) is different from true [2025-04-29 10:56:33,561 WARN L849 $PredicateComparison]: unable to prove that (and (= (store |c_old(#memory_$Pointer$#0.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#0.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#0.offset|) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#0.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#0.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#0.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_5) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0))))) is different from false [2025-04-29 10:56:33,564 WARN L871 $PredicateComparison]: unable to prove that (and (= (store |c_old(#memory_$Pointer$#0.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#0.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#0.offset|) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#0.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#0.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#0.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_5) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0))))) is different from true [2025-04-29 10:56:33,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:33,629 INFO L325 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-04-29 10:56:33,629 INFO L354 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 56 treesize of output 45 [2025-04-29 10:56:33,666 INFO L325 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2025-04-29 10:56:33,667 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 73 [2025-04-29 10:56:33,707 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| .cse2) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#t~ret6#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_sll_circular_append_#t~ret6#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1))) (let ((.cse3 (or (= (select (select |c_#memory_$Pointer$#0.offset| .cse2) 0) 0) (= .cse2 |c_ULTIMATE.start_sll_circular_append_#t~ret6#1.base|)))) (or (and (= .cse0 |c_ULTIMATE.start_sll_circular_append_#t~ret6#1.base|) .cse3) (and .cse3 (= (select (select |c_#memory_$Pointer$#0.offset| .cse0) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.base| .cse0) 0) .cse2) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2025-04-29 10:56:33,710 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| .cse2) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#t~ret6#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_sll_circular_append_#t~ret6#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1))) (let ((.cse3 (or (= (select (select |c_#memory_$Pointer$#0.offset| .cse2) 0) 0) (= .cse2 |c_ULTIMATE.start_sll_circular_append_#t~ret6#1.base|)))) (or (and (= .cse0 |c_ULTIMATE.start_sll_circular_append_#t~ret6#1.base|) .cse3) (and .cse3 (= (select (select |c_#memory_$Pointer$#0.offset| .cse0) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.base| .cse0) 0) .cse2) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2025-04-29 10:56:33,799 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (= (select (select |c_#memory_$Pointer$#0.base| .cse1) 0) .cse0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse1) 0) 0)))) is different from false [2025-04-29 10:56:33,802 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (= (select (select |c_#memory_$Pointer$#0.base| .cse1) 0) .cse0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse1) 0) 0)))) is different from true [2025-04-29 10:56:33,855 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| .cse0) 0))) (and (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (= (select (select |c_#memory_$Pointer$#0.base| .cse1) 0) .cse0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#0.offset| .cse1) 0) 0)))) is different from false [2025-04-29 10:56:33,859 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| .cse0) 0))) (and (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (= (select (select |c_#memory_$Pointer$#0.base| .cse1) 0) .cse0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#0.offset| .cse1) 0) 0)))) is different from true [2025-04-29 10:56:34,011 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#0.offset| .cse0) .cse1) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.base| .cse0) .cse1) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#0.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_16| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#0.base| .cse3) 0) .cse2) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse3) 0) 0)))) is different from false [2025-04-29 10:56:34,014 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#0.offset| .cse0) .cse1) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.base| .cse0) .cse1) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#0.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_16| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#0.base| .cse3) 0) .cse2) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse3) 0) 0)))) is different from true [2025-04-29 10:56:34,184 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse8 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| .cse7) .cse8)) (.cse1 (select (select |c_#memory_$Pointer$#0.offset| .cse7) .cse8)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| .cse2) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#0.offset| .cse0) .cse1)) (= (select (select |c_#memory_$Pointer$#0.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.base| .cse0) .cse1) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_16| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#0.base| .cse3) 0) .cse2) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse3) 0) 0)))) is different from false [2025-04-29 10:56:34,186 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse8 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| .cse7) .cse8)) (.cse1 (select (select |c_#memory_$Pointer$#0.offset| .cse7) .cse8)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| .cse2) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#0.offset| .cse0) .cse1)) (= (select (select |c_#memory_$Pointer$#0.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.base| .cse0) .cse1) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_16| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#0.base| .cse3) 0) .cse2) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse3) 0) 0)))) is different from true [2025-04-29 10:56:34,206 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-29 10:56:34,207 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 10:56:34,225 INFO L325 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2025-04-29 10:56:34,225 INFO L354 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 39 [2025-04-29 10:56:34,234 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-29 10:56:34,235 INFO L354 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 19 treesize of output 7 [2025-04-29 10:56:34,264 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_append_#t~mem9#1.offset| 0) (= 0 |c_ULTIMATE.start_sll_circular_append_#t~mem10#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_16| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_16| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_append_#t~mem9#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3))))))) (= |c_ULTIMATE.start_sll_circular_append_#t~mem10#1.base| .cse1))) is different from false [2025-04-29 10:56:34,267 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_append_#t~mem9#1.offset| 0) (= 0 |c_ULTIMATE.start_sll_circular_append_#t~mem10#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_16| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_16| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_append_#t~mem9#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3))))))) (= |c_ULTIMATE.start_sll_circular_append_#t~mem10#1.base| .cse1))) is different from true [2025-04-29 10:56:34,269 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2025-04-29 10:56:34,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:34,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654773845] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:34,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:56:34,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 36 [2025-04-29 10:56:34,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832834049] [2025-04-29 10:56:34,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:34,490 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-29 10:56:34,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:34,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-29 10:56:34,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=745, Unknown=27, NotChecked=858, Total=1722 [2025-04-29 10:56:34,491 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 36 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 28 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:56:34,637 WARN L849 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret2#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |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_sll_circular_create_#t~ret2#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret2#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= 0 |c_ULTIMATE.start_sll_circular_create_#t~ret2#1.offset|)) is different from false [2025-04-29 10:56:34,639 WARN L871 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret2#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |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_sll_circular_create_#t~ret2#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret2#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= 0 |c_ULTIMATE.start_sll_circular_create_#t~ret2#1.offset|)) is different from true [2025-04-29 10:56:34,642 WARN L849 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |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)))) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0)) is different from false [2025-04-29 10:56:34,644 WARN L871 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |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)))) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0)) is different from true [2025-04-29 10:56:34,651 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse0) 0) 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 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| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1))) (= (select (select |c_#memory_$Pointer$#0.base| .cse0) 0) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) 0))) is different from false [2025-04-29 10:56:34,653 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse0) 0) 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 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| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1))) (= (select (select |c_#memory_$Pointer$#0.base| .cse0) 0) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) 0))) is different from true [2025-04-29 10:56:34,657 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse2 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| .cse3) 0)) (.cse4 (select (select |c_#memory_$Pointer$#0.base| .cse1) 0)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#0.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#0.base| .cse0) 0)) (= (select (select |c_#memory_$Pointer$#0.offset| .cse1) 0) 0) (= 1 (select |c_#valid| .cse3)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse4) 1) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse5 (select |c_#valid| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0))) (= (select (select |c_#memory_$Pointer$#0.base| .cse4) 0) .cse1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse6 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse3) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse4) 0) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2025-04-29 10:56:34,659 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse2 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| .cse3) 0)) (.cse4 (select (select |c_#memory_$Pointer$#0.base| .cse1) 0)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#0.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#0.base| .cse0) 0)) (= (select (select |c_#memory_$Pointer$#0.offset| .cse1) 0) 0) (= 1 (select |c_#valid| .cse3)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse4) 1) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse5 (select |c_#valid| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0))) (= (select (select |c_#memory_$Pointer$#0.base| .cse4) 0) .cse1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse6 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse3) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse4) 0) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2025-04-29 10:56:34,662 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#0.offset| |c_old(#memory_$Pointer$#0.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_5) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#0.base)| |c_#memory_$Pointer$#0.base|)) is different from false [2025-04-29 10:56:34,664 WARN L871 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#0.offset| |c_old(#memory_$Pointer$#0.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_5) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#0.base)| |c_#memory_$Pointer$#0.base|)) is different from true [2025-04-29 10:56:34,668 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_$Pointer$#0.offset)| |c_#memory_$Pointer$#0.offset|))) (let ((.cse0 (@diff |c_old(#memory_$Pointer$#0.base)| |c_#memory_$Pointer$#0.base|)) (.cse3 (= |c_#memory_$Pointer$#0.offset| |c_old(#memory_$Pointer$#0.offset)|)) (.cse2 (select |c_#memory_$Pointer$#0.offset| .cse1))) (and (= (store |c_old(#memory_$Pointer$#0.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#0.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#0.offset|) (= (store |c_old(#memory_$Pointer$#0.base)| .cse0 (select |c_#memory_$Pointer$#0.base| .cse0)) |c_#memory_$Pointer$#0.base|) (= |c_node_create_#res#1.offset| 0) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_old(#memory_$Pointer$#0.base)| |c_#memory_$Pointer$#0.base|)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#0.offset| (store |c_old(#memory_$Pointer$#0.offset)| .cse1 .cse2)) (or .cse3 (= (select |c_old(#valid)| .cse1) 0)) (= (store |c_old(#memory_$Pointer$#0.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#0.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#0.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse4) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_5) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (or .cse3 (= (select .cse2 0) 0))))) is different from false [2025-04-29 10:56:34,671 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_$Pointer$#0.offset)| |c_#memory_$Pointer$#0.offset|))) (let ((.cse0 (@diff |c_old(#memory_$Pointer$#0.base)| |c_#memory_$Pointer$#0.base|)) (.cse3 (= |c_#memory_$Pointer$#0.offset| |c_old(#memory_$Pointer$#0.offset)|)) (.cse2 (select |c_#memory_$Pointer$#0.offset| .cse1))) (and (= (store |c_old(#memory_$Pointer$#0.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#0.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#0.offset|) (= (store |c_old(#memory_$Pointer$#0.base)| .cse0 (select |c_#memory_$Pointer$#0.base| .cse0)) |c_#memory_$Pointer$#0.base|) (= |c_node_create_#res#1.offset| 0) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_old(#memory_$Pointer$#0.base)| |c_#memory_$Pointer$#0.base|)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#0.offset| (store |c_old(#memory_$Pointer$#0.offset)| .cse1 .cse2)) (or .cse3 (= (select |c_old(#valid)| .cse1) 0)) (= (store |c_old(#memory_$Pointer$#0.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#0.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#0.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse4) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_5) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (or .cse3 (= (select .cse2 0) 0))))) is different from true [2025-04-29 10:56:34,680 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse7 0)) (.cse11 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse3 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#0.base| .cse11) .cse3)) (.cse5 (select (select |c_#memory_$Pointer$#0.offset| .cse11) .cse3)) (.cse0 (select (select |c_#memory_$Pointer$#0.base| .cse2) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#t~ret6#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_sll_circular_append_#t~ret6#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1))) (= .cse3 (select (select |c_#memory_$Pointer$#0.offset| .cse4) .cse5)) (let ((.cse6 (or (= (select (select |c_#memory_$Pointer$#0.offset| .cse2) 0) 0) (= .cse2 |c_ULTIMATE.start_sll_circular_append_#t~ret6#1.base|)))) (or (and (= .cse0 |c_ULTIMATE.start_sll_circular_append_#t~ret6#1.base|) .cse6) (and .cse6 (= (select (select |c_#memory_$Pointer$#0.offset| .cse0) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.base| .cse4) .cse5) (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |c_#memory_$Pointer$#0.base| .cse0) 0) .cse2) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse8) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse9 (select |v_#valid_BEFORE_CALL_15| .cse9))))))) (= (select .cse10 0) 0))))) is different from false [2025-04-29 10:56:34,684 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse7 0)) (.cse11 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse3 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#0.base| .cse11) .cse3)) (.cse5 (select (select |c_#memory_$Pointer$#0.offset| .cse11) .cse3)) (.cse0 (select (select |c_#memory_$Pointer$#0.base| .cse2) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#t~ret6#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_sll_circular_append_#t~ret6#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1))) (= .cse3 (select (select |c_#memory_$Pointer$#0.offset| .cse4) .cse5)) (let ((.cse6 (or (= (select (select |c_#memory_$Pointer$#0.offset| .cse2) 0) 0) (= .cse2 |c_ULTIMATE.start_sll_circular_append_#t~ret6#1.base|)))) (or (and (= .cse0 |c_ULTIMATE.start_sll_circular_append_#t~ret6#1.base|) .cse6) (and .cse6 (= (select (select |c_#memory_$Pointer$#0.offset| .cse0) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.base| .cse4) .cse5) (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |c_#memory_$Pointer$#0.base| .cse0) 0) .cse2) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse8) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse9 (select |v_#valid_BEFORE_CALL_15| .cse9))))))) (= (select .cse10 0) 0))))) is different from true [2025-04-29 10:56:34,692 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse4 0)) (.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse1 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| .cse10) .cse1)) (.cse3 (select (select |c_#memory_$Pointer$#0.offset| .cse10) .cse1)) (.cse5 (select (select |c_#memory_$Pointer$#0.base| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse0) 0) 0) (= .cse1 (select (select |c_#memory_$Pointer$#0.offset| .cse2) .cse3)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.base| .cse2) .cse3) (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_16| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse6 (select |v_#valid_BEFORE_CALL_16| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (= (select (select |c_#memory_$Pointer$#0.base| .cse5) 0) .cse0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse7) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse8 (select |v_#valid_BEFORE_CALL_15| .cse8))))))) (= (select .cse9 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse5) 0) 0))))) is different from false [2025-04-29 10:56:34,695 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse4 0)) (.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse1 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| .cse10) .cse1)) (.cse3 (select (select |c_#memory_$Pointer$#0.offset| .cse10) .cse1)) (.cse5 (select (select |c_#memory_$Pointer$#0.base| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse0) 0) 0) (= .cse1 (select (select |c_#memory_$Pointer$#0.offset| .cse2) .cse3)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.base| .cse2) .cse3) (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_16| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse6 (select |v_#valid_BEFORE_CALL_16| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (= (select (select |c_#memory_$Pointer$#0.base| .cse5) 0) .cse0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse7) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse8 (select |v_#valid_BEFORE_CALL_15| .cse8))))))) (= (select .cse9 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse5) 0) 0))))) is different from true [2025-04-29 10:56:34,708 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse1 0)) (.cse4 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| .cse4) .cse5)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#0.base| .cse2) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= .cse0 (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#0.offset| .cse4) .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_16| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse7 (select |v_#valid_BEFORE_CALL_16| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#0.base| .cse6) 0) .cse2) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse8) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse9 (select |v_#valid_BEFORE_CALL_15| .cse9))))))) (= (select .cse3 0) 0) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#0.offset| .cse6) 0) 0))))) is different from false [2025-04-29 10:56:34,712 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse1 0)) (.cse4 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| .cse4) .cse5)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#0.base| .cse2) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= .cse0 (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#0.offset| .cse4) .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_16| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse7 (select |v_#valid_BEFORE_CALL_16| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#0.base| .cse6) 0) .cse2) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse8) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse9 (select |v_#valid_BEFORE_CALL_15| .cse9))))))) (= (select .cse3 0) 0) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#0.offset| .cse6) 0) 0))))) is different from true [2025-04-29 10:56:34,722 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse2 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#0.base| .cse3) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$#0.offset| .cse0) .cse1) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |c_#memory_$Pointer$#0.base| .cse0) .cse1) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#0.offset| .cse3) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_16| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_16| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1))) (= (select (select |c_#memory_$Pointer$#0.base| .cse4) 0) .cse3) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7))))))) (= (select .cse8 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |c_#memory_$Pointer$#0.offset| .cse4) 0) 0))))) is different from false [2025-04-29 10:56:34,725 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse2 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#0.base| .cse3) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$#0.offset| .cse0) .cse1) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |c_#memory_$Pointer$#0.base| .cse0) .cse1) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#0.offset| .cse3) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_16| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_16| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1))) (= (select (select |c_#memory_$Pointer$#0.base| .cse4) 0) .cse3) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7))))))) (= (select .cse8 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |c_#memory_$Pointer$#0.offset| .cse4) 0) 0))))) is different from true [2025-04-29 10:56:34,735 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse4 (select (select |c_#memory_$Pointer$#0.base| .cse2) 0)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$#0.offset| .cse0) .cse1) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_#t~mem9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem10#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.base| .cse0) .cse1) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#0.offset| .cse2) 0) 0) (= .cse3 |c_ULTIMATE.start_sll_circular_append_#t~mem10#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_16| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_16| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#0.base| .cse4) 0) .cse2) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse4) 0) 0) (= .cse3 |c_ULTIMATE.start_sll_circular_append_#t~mem9#1.base|)))) is different from false [2025-04-29 10:56:34,738 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse4 (select (select |c_#memory_$Pointer$#0.base| .cse2) 0)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$#0.offset| .cse0) .cse1) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_#t~mem9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem10#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.base| .cse0) .cse1) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#0.offset| .cse2) 0) 0) (= .cse3 |c_ULTIMATE.start_sll_circular_append_#t~mem10#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_16| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_16| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#0.base| .cse4) 0) .cse2) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse4) 0) 0) (= .cse3 |c_ULTIMATE.start_sll_circular_append_#t~mem9#1.base|)))) is different from true [2025-04-29 10:56:34,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:34,817 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2025-04-29 10:56:34,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 10:56:34,818 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 28 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2025-04-29 10:56:34,818 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:34,818 INFO L225 Difference]: With dead ends: 76 [2025-04-29 10:56:34,818 INFO L226 Difference]: Without dead ends: 62 [2025-04-29 10:56:34,819 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 24 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=852, Unknown=49, NotChecked=1944, Total=2970 [2025-04-29 10:56:34,821 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1015 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:34,822 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 320 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 239 Invalid, 0 Unknown, 1015 Unchecked, 0.1s Time] [2025-04-29 10:56:34,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-04-29 10:56:34,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-04-29 10:56:34,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 53 states have internal predecessors, (60), 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-04-29 10:56:34,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2025-04-29 10:56:34,837 INFO L79 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 40 [2025-04-29 10:56:34,837 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:34,837 INFO L485 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2025-04-29 10:56:34,837 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 28 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:56:34,837 INFO L278 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2025-04-29 10:56:34,838 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-29 10:56:34,838 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:34,838 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:34,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-29 10:56:35,038 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:35,038 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:35,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:35,039 INFO L85 PathProgramCache]: Analyzing trace with hash -100105040, now seen corresponding path program 1 times [2025-04-29 10:56:35,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:35,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332356888] [2025-04-29 10:56:35,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:35,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:35,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 10:56:35,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 10:56:35,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:35,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:36,641 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:36,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:36,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332356888] [2025-04-29 10:56:36,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332356888] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:36,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042100309] [2025-04-29 10:56:36,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:36,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:36,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:36,643 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:56:36,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 10:56:36,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 10:56:36,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 10:56:36,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:36,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:36,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 167 conjuncts are in the unsatisfiable core [2025-04-29 10:56:36,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:37,005 INFO L354 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-04-29 10:56:37,011 INFO L354 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-04-29 10:56:37,217 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 10:56:37,217 INFO L354 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-04-29 10:56:37,240 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:56:37,240 INFO L354 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-04-29 10:56:37,293 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 10:56:37,301 INFO L354 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-04-29 10:56:37,308 INFO L354 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-04-29 10:56:37,367 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 10:56:37,367 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 75 [2025-04-29 10:56:37,370 INFO L354 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-04-29 10:56:37,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:37,376 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2025-04-29 10:56:37,487 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2025-04-29 10:56:37,491 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 10:56:37,506 INFO L354 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-04-29 10:56:37,511 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-29 10:56:37,736 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-29 10:56:37,737 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-04-29 10:56:37,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:37,748 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2025-04-29 10:56:37,761 INFO L325 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-04-29 10:56:37,761 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2025-04-29 10:56:37,783 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-29 10:56:37,783 INFO L354 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-04-29 10:56:38,422 INFO L325 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2025-04-29 10:56:38,423 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 209 treesize of output 106 [2025-04-29 10:56:38,443 INFO L325 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2025-04-29 10:56:38,444 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 270 treesize of output 145 [2025-04-29 10:56:38,450 INFO L354 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 107 treesize of output 34 [2025-04-29 10:56:38,454 INFO L354 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 0 case distinctions, treesize of input 83 treesize of output 65 [2025-04-29 10:56:38,460 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 33 [2025-04-29 10:56:38,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:38,468 INFO L354 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 19 [2025-04-29 10:56:38,571 INFO L354 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 109 treesize of output 69 [2025-04-29 10:56:38,685 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-29 10:56:38,686 INFO L354 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 66 treesize of output 33 [2025-04-29 10:56:38,691 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 10:56:38,766 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:38,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:38,880 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_927) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_922) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_924) .cse0) .cse1)) (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_929) .cse0) .cse1) 4)))) (not (= v_ArrVal_927 (store (select |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_927 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))))) is different from false [2025-04-29 10:56:39,087 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_922 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| Int) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$#0.base| .cse0)) (.cse2 (select |c_#memory_$Pointer$#0.offset| .cse0))) (or (< (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31|) (not (= v_ArrVal_927 (store (select |c_#memory_int#0| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| (select v_ArrVal_927 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31|)))) (not (= (select .cse1 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31|) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (not (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (select .cse2 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31|))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#0| .cse0 v_ArrVal_927) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_922) (select (select (store (store |c_#memory_$Pointer$#0.base| .cse0 (store .cse1 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_924) .cse3) .cse4)) (+ 4 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 (store .cse2 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_929) .cse3) .cse4))))))))) is different from false [2025-04-29 10:56:39,140 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_922 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| Int) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| .cse6) .cse5))) (let ((.cse4 (select |c_#memory_$Pointer$#0.offset| .cse0)) (.cse1 (select |c_#memory_$Pointer$#0.base| .cse0))) (or (not (= v_ArrVal_927 (store (select |c_#memory_int#0| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| (select v_ArrVal_927 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31|)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#0| .cse0 v_ArrVal_927) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_922) (select (select (store (store |c_#memory_$Pointer$#0.base| .cse0 (store .cse1 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_924) .cse2) .cse3)) (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 (store .cse4 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_929) .cse2) .cse3) 4)))) (not (= .cse5 (select .cse4 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31|))) (not (= (select .cse1 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31|) .cse6)) (< (select (select |c_#memory_$Pointer$#0.offset| .cse6) .cse5) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31|)))))) is different from false [2025-04-29 10:56:39,158 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_922 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| Int) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| .cse6) .cse5))) (let ((.cse4 (select |c_#memory_$Pointer$#0.offset| .cse0)) (.cse1 (select |c_#memory_$Pointer$#0.base| .cse0))) (or (not (= v_ArrVal_927 (store (select |c_#memory_int#0| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| (select v_ArrVal_927 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31|)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#0| .cse0 v_ArrVal_927) |c_ULTIMATE.start_sll_circular_append_#t~ret6#1.base| v_ArrVal_922) (select (select (store (store |c_#memory_$Pointer$#0.base| .cse0 (store .cse1 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |c_ULTIMATE.start_sll_circular_append_#t~ret6#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret6#1.base| v_ArrVal_924) .cse2) .cse3)) (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 (store .cse4 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |c_ULTIMATE.start_sll_circular_append_#t~ret6#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret6#1.base| v_ArrVal_929) .cse2) .cse3) 4)))) (not (= .cse5 (select .cse4 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31|))) (not (= (select .cse1 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31|) .cse6)) (< (select (select |c_#memory_$Pointer$#0.offset| .cse6) .cse5) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31|)))))) is different from false [2025-04-29 10:56:39,236 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_922 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| Int) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_939 (Array Int Int)) (v_ArrVal_938 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_929 (Array Int Int)) (v_ArrVal_940 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret6#1.base_30| Int)) (let ((.cse8 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_circular_append_#t~ret6#1.base_30| v_ArrVal_938)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse7 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret6#1.base_30| v_ArrVal_939)) (.cse2 (select (select .cse8 .cse4) .cse1))) (let ((.cse3 (select .cse8 .cse2)) (.cse0 (select .cse7 .cse2))) (or (not (= (select .cse0 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31|) .cse1)) (not (= v_ArrVal_927 (store (select (store |c_#memory_int#0| |v_ULTIMATE.start_sll_circular_append_#t~ret6#1.base_30| v_ArrVal_940) .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| (select v_ArrVal_927 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret6#1.base_30|) 0)) (not (= (select .cse3 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31|) .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#0| .cse2 v_ArrVal_927) |v_ULTIMATE.start_sll_circular_append_#t~ret6#1.base_30| v_ArrVal_922) (select (select (store (store |c_#memory_$Pointer$#0.base| .cse2 (store .cse3 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |v_ULTIMATE.start_sll_circular_append_#t~ret6#1.base_30|)) |v_ULTIMATE.start_sll_circular_append_#t~ret6#1.base_30| v_ArrVal_924) .cse5) .cse6)) (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse2 (store .cse0 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret6#1.base_30| v_ArrVal_929) .cse5) .cse6) 4)))) (< (select (select .cse7 .cse4) .cse1) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31|)))))) is different from false [2025-04-29 10:56:39,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042100309] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:39,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:56:39,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 47 [2025-04-29 10:56:39,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535612960] [2025-04-29 10:56:39,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:39,239 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-04-29 10:56:39,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:39,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-04-29 10:56:39,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2482, Unknown=5, NotChecked=520, Total=3192 [2025-04-29 10:56:39,240 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 47 states, 43 states have (on average 1.441860465116279) internal successors, (62), 38 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:56:40,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:40,449 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2025-04-29 10:56:40,450 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-29 10:56:40,450 INFO L79 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 1.441860465116279) internal successors, (62), 38 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2025-04-29 10:56:40,450 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:40,451 INFO L225 Difference]: With dead ends: 79 [2025-04-29 10:56:40,451 INFO L226 Difference]: Without dead ends: 77 [2025-04-29 10:56:40,452 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 979 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=331, Invalid=4240, Unknown=5, NotChecked=680, Total=5256 [2025-04-29 10:56:40,452 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 52 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:40,452 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 247 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 850 Invalid, 1 Unknown, 0 Unchecked, 0.5s Time] [2025-04-29 10:56:40,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-04-29 10:56:40,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2025-04-29 10:56:40,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 60 states have internal predecessors, (67), 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-04-29 10:56:40,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2025-04-29 10:56:40,468 INFO L79 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 40 [2025-04-29 10:56:40,468 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:40,468 INFO L485 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2025-04-29 10:56:40,469 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 1.441860465116279) internal successors, (62), 38 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:56:40,469 INFO L278 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2025-04-29 10:56:40,470 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 10:56:40,471 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:40,471 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:40,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-29 10:56:40,671 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:40,672 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:40,672 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:40,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1711624505, now seen corresponding path program 1 times [2025-04-29 10:56:40,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:40,672 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157681777] [2025-04-29 10:56:40,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:40,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:40,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 10:56:40,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 10:56:40,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:40,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:41,900 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:56:41,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:41,901 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157681777] [2025-04-29 10:56:41,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157681777] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:41,901 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415116498] [2025-04-29 10:56:41,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:41,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:41,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:41,904 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:56:41,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 10:56:41,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 10:56:42,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 10:56:42,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:42,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:42,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 140 conjuncts are in the unsatisfiable core [2025-04-29 10:56:42,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:42,247 INFO L354 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-04-29 10:56:42,374 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:56:42,374 INFO L354 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-04-29 10:56:42,413 INFO L354 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-04-29 10:56:42,421 INFO L354 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-04-29 10:56:42,464 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 10:56:42,464 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-04-29 10:56:42,466 INFO L354 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-04-29 10:56:42,544 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-29 10:56:42,547 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 10:56:42,550 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-04-29 10:56:42,713 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-29 10:56:42,714 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-04-29 10:56:42,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:42,726 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2025-04-29 10:56:42,737 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-29 10:56:42,737 INFO L354 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-04-29 10:56:43,226 INFO L325 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2025-04-29 10:56:43,226 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 72 [2025-04-29 10:56:43,239 INFO L325 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2025-04-29 10:56:43,239 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 95 [2025-04-29 10:56:43,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:43,247 INFO L354 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 0 case distinctions, treesize of input 83 treesize of output 65 [2025-04-29 10:56:43,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:43,250 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 33 [2025-04-29 10:56:43,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:43,392 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2025-04-29 10:56:43,396 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-29 10:56:43,397 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 10:56:43,446 INFO L354 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 67 treesize of output 43 [2025-04-29 10:56:43,450 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 10:56:43,450 INFO L354 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 40 treesize of output 19 [2025-04-29 10:56:43,451 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:43,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:43,905 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1077 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret6#1.base_34| Int) (v_ArrVal_1076 (Array Int Int)) (v_ArrVal_1086 (Array Int Int)) (v_ArrVal_1085 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_circular_append_#t~ret6#1.base_34| v_ArrVal_1085)) (.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse9 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret6#1.base_34| v_ArrVal_1086)) (.cse3 (select (select .cse10 .cse8) .cse7))) (let ((.cse6 (select .cse9 .cse3)) (.cse4 (select .cse10 .cse3)) (.cse5 (select (select .cse9 .cse8) .cse7))) (or (not (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (let ((.cse1 (store (store |c_#memory_$Pointer$#0.base| .cse3 (store .cse4 .cse5 |v_ULTIMATE.start_sll_circular_append_#t~ret6#1.base_34|)) |v_ULTIMATE.start_sll_circular_append_#t~ret6#1.base_34| v_ArrVal_1076))) (select .cse1 (select (select .cse1 .cse0) .cse2))) (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse3 (store .cse6 .cse5 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret6#1.base_34| v_ArrVal_1077) .cse0) .cse2)))))) (not (= (select .cse6 .cse5) .cse7)) (not (= (select .cse4 .cse5) .cse8)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret6#1.base_34|) 0))))))) is different from false [2025-04-29 10:56:43,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415116498] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:43,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:56:43,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27] total 44 [2025-04-29 10:56:43,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099541607] [2025-04-29 10:56:43,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:43,907 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-04-29 10:56:43,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:43,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-04-29 10:56:43,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2283, Unknown=12, NotChecked=96, Total=2550 [2025-04-29 10:56:43,908 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand has 44 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 37 states have internal predecessors, (64), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-29 10:56:45,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:45,622 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2025-04-29 10:56:45,622 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-29 10:56:45,623 INFO L79 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 37 states have internal predecessors, (64), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2025-04-29 10:56:45,623 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:45,623 INFO L225 Difference]: With dead ends: 93 [2025-04-29 10:56:45,623 INFO L226 Difference]: Without dead ends: 90 [2025-04-29 10:56:45,624 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=429, Invalid=5725, Unknown=12, NotChecked=154, Total=6320 [2025-04-29 10:56:45,625 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 91 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:45,625 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 409 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-29 10:56:45,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-04-29 10:56:45,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2025-04-29 10:56:45,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 61 states have internal predecessors, (68), 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-04-29 10:56:45,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2025-04-29 10:56:45,635 INFO L79 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 42 [2025-04-29 10:56:45,635 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:45,635 INFO L485 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2025-04-29 10:56:45,635 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 37 states have internal predecessors, (64), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-29 10:56:45,636 INFO L278 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2025-04-29 10:56:45,636 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-29 10:56:45,636 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:45,636 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:45,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-29 10:56:45,836 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:45,837 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:45,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:45,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1520828907, now seen corresponding path program 2 times [2025-04-29 10:56:45,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:45,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190222933] [2025-04-29 10:56:45,837 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:56:45,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:45,849 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-29 10:56:45,868 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 10:56:45,868 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:56:45,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:47,647 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:47,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:47,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190222933] [2025-04-29 10:56:47,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190222933] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:47,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796195558] [2025-04-29 10:56:47,647 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:56:47,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:47,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:47,649 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:56:47,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-29 10:56:47,727 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-29 10:56:47,765 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 10:56:47,765 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:56:47,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:47,767 WARN L254 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 179 conjuncts are in the unsatisfiable core [2025-04-29 10:56:47,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:47,796 INFO L354 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-04-29 10:56:47,824 INFO L354 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-04-29 10:56:48,031 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 10:56:48,032 INFO L354 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-04-29 10:56:48,044 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:56:48,044 INFO L354 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-04-29 10:56:48,092 INFO L354 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-04-29 10:56:48,096 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 10:56:48,101 INFO L354 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-04-29 10:56:48,170 INFO L325 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-04-29 10:56:48,171 INFO L354 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 94 treesize of output 60 [2025-04-29 10:56:48,175 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2025-04-29 10:56:48,179 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-04-29 10:56:48,335 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-29 10:56:48,336 INFO L354 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 79 treesize of output 38 [2025-04-29 10:56:48,341 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 10:56:48,345 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-29 10:56:48,349 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-29 10:56:48,471 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-04-29 10:56:48,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:48,567 INFO L325 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-04-29 10:56:48,567 INFO L354 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 87 treesize of output 64 [2025-04-29 10:56:48,587 INFO L325 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2025-04-29 10:56:48,587 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 53 [2025-04-29 10:56:48,609 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-29 10:56:48,609 INFO L354 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-04-29 10:56:48,618 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2025-04-29 10:56:49,188 INFO L325 Elim1Store]: treesize reduction 108, result has 43.2 percent of original size [2025-04-29 10:56:49,188 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 110 [2025-04-29 10:56:49,245 INFO L325 Elim1Store]: treesize reduction 118, result has 36.2 percent of original size [2025-04-29 10:56:49,246 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 164 treesize of output 145 [2025-04-29 10:56:49,282 INFO L325 Elim1Store]: treesize reduction 79, result has 31.3 percent of original size [2025-04-29 10:56:49,282 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 131 [2025-04-29 10:56:49,293 INFO L354 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 34 [2025-04-29 10:56:49,328 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:56:49,328 INFO L354 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 20 treesize of output 1 [2025-04-29 10:56:49,339 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 22 [2025-04-29 10:56:50,840 INFO L325 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2025-04-29 10:56:50,840 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 73 [2025-04-29 10:56:50,848 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2025-04-29 10:56:50,855 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2025-04-29 10:56:50,859 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 Killed by 15