./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 13:09:24,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 13:09:24,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 13:09:24,721 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 13:09:24,721 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 13:09:24,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 13:09:24,757 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 13:09:24,757 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 13:09:24,758 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 13:09:24,759 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 13:09:24,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 13:09:24,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 13:09:24,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 13:09:24,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 13:09:24,762 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 13:09:24,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 13:09:24,763 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 13:09:24,763 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 13:09:24,764 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 13:09:24,764 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 13:09:24,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 13:09:24,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 13:09:24,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 13:09:24,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 13:09:24,766 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 13:09:24,766 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 13:09:24,766 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 13:09:24,767 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 13:09:24,770 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 13:09:24,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 13:09:24,771 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 13:09:24,771 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 13:09:24,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:09:24,771 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 13:09:24,771 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 13:09:24,772 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 13:09:24,772 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 13:09:24,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 13:09:24,772 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 13:09:24,773 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 13:09:24,773 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 13:09:24,774 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 13:09:24,775 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2024-11-18 13:09:25,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 13:09:25,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 13:09:25,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 13:09:25,054 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 13:09:25,054 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 13:09:25,056 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2024-11-18 13:09:26,606 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 13:09:26,867 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 13:09:26,869 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2024-11-18 13:09:26,887 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b46fe98fb/8159eb4fc9224d66a786f6398e9841d2/FLAG7980e900c [2024-11-18 13:09:27,166 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b46fe98fb/8159eb4fc9224d66a786f6398e9841d2 [2024-11-18 13:09:27,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 13:09:27,169 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 13:09:27,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 13:09:27,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 13:09:27,176 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 13:09:27,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:09:27" (1/1) ... [2024-11-18 13:09:27,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64c9dec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:27, skipping insertion in model container [2024-11-18 13:09:27,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:09:27" (1/1) ... [2024-11-18 13:09:27,222 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 13:09:27,517 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2024-11-18 13:09:27,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:09:27,531 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 13:09:27,579 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2024-11-18 13:09:27,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:09:27,609 INFO L204 MainTranslator]: Completed translation [2024-11-18 13:09:27,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:27 WrapperNode [2024-11-18 13:09:27,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 13:09:27,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 13:09:27,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 13:09:27,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 13:09:27,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:27" (1/1) ... [2024-11-18 13:09:27,633 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:27" (1/1) ... [2024-11-18 13:09:27,660 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 161 [2024-11-18 13:09:27,661 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 13:09:27,662 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 13:09:27,662 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 13:09:27,662 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 13:09:27,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:27" (1/1) ... [2024-11-18 13:09:27,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:27" (1/1) ... [2024-11-18 13:09:27,675 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:27" (1/1) ... [2024-11-18 13:09:27,707 INFO L175 MemorySlicer]: Split 28 memory accesses to 3 slices as follows [2, 16, 10]. 57 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 8 writes are split as follows [0, 7, 1]. [2024-11-18 13:09:27,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:27" (1/1) ... [2024-11-18 13:09:27,708 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:27" (1/1) ... [2024-11-18 13:09:27,715 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:27" (1/1) ... [2024-11-18 13:09:27,719 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:27" (1/1) ... [2024-11-18 13:09:27,721 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:27" (1/1) ... [2024-11-18 13:09:27,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:27" (1/1) ... [2024-11-18 13:09:27,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 13:09:27,728 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 13:09:27,729 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 13:09:27,729 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 13:09:27,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:27" (1/1) ... [2024-11-18 13:09:27,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:09:27,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:09:27,777 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) [2024-11-18 13:09:27,784 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 [2024-11-18 13:09:27,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-18 13:09:27,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-18 13:09:27,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-18 13:09:27,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-18 13:09:27,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-18 13:09:27,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-18 13:09:27,834 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-18 13:09:27,834 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-18 13:09:27,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-18 13:09:27,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 13:09:27,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-18 13:09:27,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-18 13:09:27,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-18 13:09:27,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-18 13:09:27,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-18 13:09:27,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-18 13:09:27,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-18 13:09:27,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-18 13:09:27,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-18 13:09:27,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-18 13:09:27,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-18 13:09:27,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 13:09:27,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 13:09:27,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-18 13:09:27,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 13:09:27,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 13:09:27,987 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 13:09:27,989 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 13:09:28,257 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-18 13:09:28,258 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 13:09:28,274 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 13:09:28,274 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-18 13:09:28,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:09:28 BoogieIcfgContainer [2024-11-18 13:09:28,275 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 13:09:28,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 13:09:28,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 13:09:28,280 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 13:09:28,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:09:27" (1/3) ... [2024-11-18 13:09:28,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb76d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:09:28, skipping insertion in model container [2024-11-18 13:09:28,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:27" (2/3) ... [2024-11-18 13:09:28,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb76d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:09:28, skipping insertion in model container [2024-11-18 13:09:28,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:09:28" (3/3) ... [2024-11-18 13:09:28,283 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2024-11-18 13:09:28,297 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 13:09:28,297 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 13:09:28,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 13:09:28,367 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6e89abb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 13:09:28,368 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 13:09:28,371 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 34 states have internal predecessors, (50), 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) [2024-11-18 13:09:28,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-18 13:09:28,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:09:28,392 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:09:28,393 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:09:28,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:09:28,399 INFO L85 PathProgramCache]: Analyzing trace with hash -2119803949, now seen corresponding path program 1 times [2024-11-18 13:09:28,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:09:28,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861323323] [2024-11-18 13:09:28,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:28,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:09:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:28,664 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 13:09:28,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:09:28,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861323323] [2024-11-18 13:09:28,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861323323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:09:28,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:09:28,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 13:09:28,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858975409] [2024-11-18 13:09:28,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:09:28,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 13:09:28,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:09:28,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 13:09:28,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 13:09:28,705 INFO L87 Difference]: Start difference. First operand has 39 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 34 states have internal predecessors, (50), 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 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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) [2024-11-18 13:09:28,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:09:28,728 INFO L93 Difference]: Finished difference Result 71 states and 101 transitions. [2024-11-18 13:09:28,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 13:09:28,731 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 25 [2024-11-18 13:09:28,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:09:28,737 INFO L225 Difference]: With dead ends: 71 [2024-11-18 13:09:28,738 INFO L226 Difference]: Without dead ends: 31 [2024-11-18 13:09:28,741 INFO L431 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 [2024-11-18 13:09:28,744 INFO L432 NwaCegarLoop]: 50 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, 50 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 [2024-11-18 13:09:28,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:09:28,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-18 13:09:28,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-18 13:09:28,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-18 13:09:28,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-11-18 13:09:28,779 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 25 [2024-11-18 13:09:28,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:09:28,780 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-18 13:09:28,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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) [2024-11-18 13:09:28,781 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2024-11-18 13:09:28,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-18 13:09:28,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:09:28,782 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:09:28,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 13:09:28,783 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:09:28,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:09:28,784 INFO L85 PathProgramCache]: Analyzing trace with hash -826043684, now seen corresponding path program 1 times [2024-11-18 13:09:28,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:09:28,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139574649] [2024-11-18 13:09:28,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:28,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:09:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:29,064 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 13:09:29,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:09:29,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139574649] [2024-11-18 13:09:29,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139574649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:09:29,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:09:29,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 13:09:29,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337919971] [2024-11-18 13:09:29,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:09:29,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 13:09:29,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:09:29,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 13:09:29,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 13:09:29,071 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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) [2024-11-18 13:09:29,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:09:29,092 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2024-11-18 13:09:29,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 13:09:29,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 26 [2024-11-18 13:09:29,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:09:29,097 INFO L225 Difference]: With dead ends: 58 [2024-11-18 13:09:29,097 INFO L226 Difference]: Without dead ends: 34 [2024-11-18 13:09:29,098 INFO L431 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 [2024-11-18 13:09:29,099 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:09:29,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 69 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:09:29,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-18 13:09:29,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-11-18 13:09:29,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-18 13:09:29,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-11-18 13:09:29,108 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 26 [2024-11-18 13:09:29,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:09:29,109 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-11-18 13:09:29,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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) [2024-11-18 13:09:29,109 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-11-18 13:09:29,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-18 13:09:29,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:09:29,110 INFO L215 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] [2024-11-18 13:09:29,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 13:09:29,111 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:09:29,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:09:29,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1959720012, now seen corresponding path program 1 times [2024-11-18 13:09:29,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:09:29,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154590417] [2024-11-18 13:09:29,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:29,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:09:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:29,624 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 13:09:29,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:09:29,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154590417] [2024-11-18 13:09:29,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154590417] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:09:29,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968713894] [2024-11-18 13:09:29,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:29,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:09:29,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:09:29,628 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) [2024-11-18 13:09:29,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 13:09:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:29,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-18 13:09:29,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:09:29,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-18 13:09:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 13:09:29,986 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:09:30,064 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 13:09:30,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968713894] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:09:30,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:09:30,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 12 [2024-11-18 13:09:30,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142298546] [2024-11-18 13:09:30,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:09:30,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-18 13:09:30,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:09:30,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-18 13:09:30,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-18 13:09:30,066 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 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) [2024-11-18 13:09:34,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-18 13:09:38,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-18 13:09:42,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-18 13:09:46,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-18 13:09:46,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:09:46,336 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2024-11-18 13:09:46,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 13:09:46,337 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 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 34 [2024-11-18 13:09:46,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:09:46,338 INFO L225 Difference]: With dead ends: 50 [2024-11-18 13:09:46,338 INFO L226 Difference]: Without dead ends: 39 [2024-11-18 13:09:46,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-11-18 13:09:46,340 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 21 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2024-11-18 13:09:46,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 289 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 4 Unknown, 0 Unchecked, 16.2s Time] [2024-11-18 13:09:46,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-18 13:09:46,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-11-18 13:09:46,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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) [2024-11-18 13:09:46,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-11-18 13:09:46,354 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 34 [2024-11-18 13:09:46,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:09:46,354 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-11-18 13:09:46,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 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) [2024-11-18 13:09:46,355 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-11-18 13:09:46,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-18 13:09:46,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:09:46,356 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:09:46,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 13:09:46,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:09:46,557 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:09:46,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:09:46,557 INFO L85 PathProgramCache]: Analyzing trace with hash -158694653, now seen corresponding path program 1 times [2024-11-18 13:09:46,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:09:46,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974687799] [2024-11-18 13:09:46,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:46,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:09:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:47,462 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 13:09:47,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:09:47,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974687799] [2024-11-18 13:09:47,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974687799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:09:47,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418124369] [2024-11-18 13:09:47,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:47,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:09:47,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:09:47,468 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) [2024-11-18 13:09:47,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 13:09:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:47,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-11-18 13:09:47,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:09:47,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-18 13:09:47,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-18 13:09:47,895 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-18 13:09:47,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-18 13:09:47,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:09:47,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-18 13:09:48,069 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-18 13:09:48,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-18 13:09:48,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 13 [2024-11-18 13:09:48,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2024-11-18 13:09:48,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2024-11-18 13:09:48,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-18 13:09:48,375 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-18 13:09:48,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2024-11-18 13:09:48,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-18 13:09:48,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:09:48,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2024-11-18 13:09:48,425 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-11-18 13:09:48,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-18 13:09:48,620 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2024-11-18 13:09:48,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 59 [2024-11-18 13:09:48,653 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2024-11-18 13:09:48,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 86 [2024-11-18 13:09:48,690 INFO L349 Elim1Store]: treesize reduction 41, result has 46.1 percent of original size [2024-11-18 13:09:48,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 39 [2024-11-18 13:09:48,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2024-11-18 13:09:48,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 65 [2024-11-18 13:09:48,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 95 [2024-11-18 13:09:48,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 66 [2024-11-18 13:09:48,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:09:48,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 32 [2024-11-18 13:09:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:09:49,015 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:09:49,443 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (v_ArrVal_349 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_350 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_348) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_350) .cse0) (+ .cse1 4)) |c_ULTIMATE.start_main_~data~0#1|) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_349) .cse0) .cse1) .cse0)) (not (= (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_348 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) v_ArrVal_348))))) is different from false [2024-11-18 13:09:53,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418124369] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:09:53,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:09:53,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 34 [2024-11-18 13:09:53,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215584812] [2024-11-18 13:09:53,617 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:09:53,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-18 13:09:53,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:09:53,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-18 13:09:53,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1503, Unknown=23, NotChecked=78, Total=1722 [2024-11-18 13:09:53,619 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 34 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 27 states have internal predecessors, (54), 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) [2024-11-18 13:09:54,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:09:54,855 INFO L93 Difference]: Finished difference Result 90 states and 113 transitions. [2024-11-18 13:09:54,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-18 13:09:54,856 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 27 states have internal predecessors, (54), 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 37 [2024-11-18 13:09:54,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:09:54,858 INFO L225 Difference]: With dead ends: 90 [2024-11-18 13:09:54,858 INFO L226 Difference]: Without dead ends: 82 [2024-11-18 13:09:54,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=276, Invalid=3363, Unknown=25, NotChecked=118, Total=3782 [2024-11-18 13:09:54,860 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 95 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 13:09:54,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 388 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 13:09:54,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-18 13:09:54,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 53. [2024-11-18 13:09:54,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-18 13:09:54,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2024-11-18 13:09:54,871 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 37 [2024-11-18 13:09:54,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:09:54,872 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2024-11-18 13:09:54,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 27 states have internal predecessors, (54), 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) [2024-11-18 13:09:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2024-11-18 13:09:54,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-18 13:09:54,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:09:54,873 INFO L215 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] [2024-11-18 13:09:54,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 13:09:55,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-18 13:09:55,074 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:09:55,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:09:55,075 INFO L85 PathProgramCache]: Analyzing trace with hash -2134977410, now seen corresponding path program 1 times [2024-11-18 13:09:55,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:09:55,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394051706] [2024-11-18 13:09:55,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:55,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:09:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:55,987 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-18 13:09:55,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:09:55,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394051706] [2024-11-18 13:09:55,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394051706] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:09:55,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705855274] [2024-11-18 13:09:55,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:55,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:09:55,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:09:55,993 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) [2024-11-18 13:09:55,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 13:09:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:56,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 163 conjuncts are in the unsatisfiable core [2024-11-18 13:09:56,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:09:56,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-18 13:09:56,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:09:56,591 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-18 13:09:56,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-18 13:09:56,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:09:56,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-18 13:09:56,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:09:56,780 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-18 13:09:56,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 43 [2024-11-18 13:09:56,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-18 13:09:56,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-18 13:09:56,955 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-18 13:09:56,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 24 [2024-11-18 13:09:56,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-18 13:09:56,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-18 13:09:56,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-18 13:09:57,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:09:57,205 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-18 13:09:57,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 49 [2024-11-18 13:09:57,225 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-18 13:09:57,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-18 13:09:57,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-18 13:09:57,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-18 13:09:57,633 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:09:57,634 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:09:57,639 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-18 13:09:57,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 29 [2024-11-18 13:09:57,748 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-18 13:09:57,748 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:10:02,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705855274] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:02,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:10:02,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 37 [2024-11-18 13:10:02,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580390979] [2024-11-18 13:10:02,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:10:02,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-18 13:10:02,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:10:02,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-18 13:10:02,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1906, Unknown=11, NotChecked=0, Total=2070 [2024-11-18 13:10:02,322 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 37 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 29 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 13:10:03,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:10:03,482 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2024-11-18 13:10:03,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-18 13:10:03,486 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 29 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2024-11-18 13:10:03,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:10:03,487 INFO L225 Difference]: With dead ends: 90 [2024-11-18 13:10:03,487 INFO L226 Difference]: Without dead ends: 76 [2024-11-18 13:10:03,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=296, Invalid=3475, Unknown=11, NotChecked=0, Total=3782 [2024-11-18 13:10:03,493 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 41 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 13:10:03,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 424 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 13:10:03,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-18 13:10:03,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2024-11-18 13:10:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 59 states have internal predecessors, (69), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-18 13:10:03,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2024-11-18 13:10:03,511 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 39 [2024-11-18 13:10:03,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:10:03,511 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2024-11-18 13:10:03,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 29 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 13:10:03,512 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2024-11-18 13:10:03,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-18 13:10:03,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:03,513 INFO L215 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, 1] [2024-11-18 13:10:03,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-18 13:10:03,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:10:03,716 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:03,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:03,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1669816953, now seen corresponding path program 1 times [2024-11-18 13:10:03,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:03,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353701995] [2024-11-18 13:10:03,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:03,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:05,935 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 13:10:05,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:05,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353701995] [2024-11-18 13:10:05,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353701995] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:05,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69094560] [2024-11-18 13:10:05,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:05,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:10:05,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:10:05,938 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) [2024-11-18 13:10:05,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 13:10:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:06,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 139 conjuncts are in the unsatisfiable core [2024-11-18 13:10:06,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:10:06,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-18 13:10:06,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:10:06,443 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-18 13:10:06,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-18 13:10:06,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:10:06,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-18 13:10:06,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:10:06,622 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-18 13:10:06,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 57 [2024-11-18 13:10:06,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-18 13:10:06,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-18 13:10:06,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-18 13:10:06,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-18 13:10:06,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-18 13:10:06,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-18 13:10:06,982 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-18 13:10:06,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-18 13:10:07,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:10:07,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2024-11-18 13:10:07,017 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-18 13:10:07,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-18 13:10:07,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-18 13:10:07,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-18 13:10:07,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2024-11-18 13:10:07,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2024-11-18 13:10:07,628 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-18 13:10:07,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-18 13:10:07,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-18 13:10:07,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-18 13:10:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 13:10:07,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:10:07,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-18 13:10:08,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69094560] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:08,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:10:08,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27] total 44 [2024-11-18 13:10:08,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865725518] [2024-11-18 13:10:08,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:10:08,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-18 13:10:08,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:10:08,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-18 13:10:08,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2699, Unknown=8, NotChecked=0, Total=2862 [2024-11-18 13:10:08,661 INFO L87 Difference]: Start difference. First operand 70 states and 83 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) [2024-11-18 13:10:10,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:10:10,945 INFO L93 Difference]: Finished difference Result 122 states and 150 transitions. [2024-11-18 13:10:10,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-18 13:10:10,946 INFO L78 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 41 [2024-11-18 13:10:10,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:10:10,947 INFO L225 Difference]: With dead ends: 122 [2024-11-18 13:10:10,947 INFO L226 Difference]: Without dead ends: 114 [2024-11-18 13:10:10,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=444, Invalid=7030, Unknown=8, NotChecked=0, Total=7482 [2024-11-18 13:10:10,950 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 132 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 13:10:10,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 553 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 13:10:10,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-18 13:10:10,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 88. [2024-11-18 13:10:10,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 77 states have internal predecessors, (91), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-18 13:10:10,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 105 transitions. [2024-11-18 13:10:10,967 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 105 transitions. Word has length 41 [2024-11-18 13:10:10,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:10:10,967 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 105 transitions. [2024-11-18 13:10:10,967 INFO L472 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) [2024-11-18 13:10:10,968 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2024-11-18 13:10:10,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-18 13:10:10,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:10,969 INFO L215 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, 1, 1, 1] [2024-11-18 13:10:10,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-18 13:10:11,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:10:11,170 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:11,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:11,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1234936396, now seen corresponding path program 2 times [2024-11-18 13:10:11,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:11,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112682460] [2024-11-18 13:10:11,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:10:11,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:11,259 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:10:11,259 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:10:16,589 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:10:16,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:16,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112682460] [2024-11-18 13:10:16,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112682460] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:16,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9227632] [2024-11-18 13:10:16,590 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:10:16,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:10:16,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:10:16,593 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) [2024-11-18 13:10:16,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 13:10:17,013 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:10:17,013 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:10:17,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 176 conjuncts are in the unsatisfiable core [2024-11-18 13:10:17,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:10:17,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-18 13:10:17,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:10:17,328 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-18 13:10:17,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-18 13:10:17,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:10:17,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:10:17,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-18 13:10:17,573 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-18 13:10:17,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2024-11-18 13:10:17,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-18 13:10:17,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-11-18 13:10:17,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2024-11-18 13:10:17,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-18 13:10:17,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-18 13:10:17,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-18 13:10:18,039 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-18 13:10:18,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-18 13:10:18,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:10:18,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2024-11-18 13:10:18,074 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-18 13:10:18,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-18 13:10:18,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-11-18 13:10:19,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2024-11-18 13:10:19,103 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2024-11-18 13:10:19,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 54 [2024-11-18 13:10:19,137 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2024-11-18 13:10:19,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 94 [2024-11-18 13:10:19,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2024-11-18 13:10:19,177 INFO L349 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2024-11-18 13:10:19,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 47 [2024-11-18 13:10:19,203 INFO L349 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2024-11-18 13:10:19,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 41 [2024-11-18 13:10:19,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2024-11-18 13:10:19,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 45 [2024-11-18 13:10:19,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 47 [2024-11-18 13:10:19,817 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-18 13:10:19,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 44 [2024-11-18 13:10:19,981 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:10:19,981 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:10:21,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9227632] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:21,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:10:21,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 53 [2024-11-18 13:10:21,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293287501] [2024-11-18 13:10:21,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:10:21,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-18 13:10:21,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:10:21,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-18 13:10:21,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=4156, Unknown=33, NotChecked=0, Total=4422 [2024-11-18 13:10:21,908 INFO L87 Difference]: Start difference. First operand 88 states and 105 transitions. Second operand has 53 states, 50 states have (on average 1.36) internal successors, (68), 44 states have internal predecessors, (68), 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) [2024-11-18 13:10:26,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:10:26,202 INFO L93 Difference]: Finished difference Result 143 states and 177 transitions. [2024-11-18 13:10:26,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-18 13:10:26,203 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 50 states have (on average 1.36) internal successors, (68), 44 states have internal predecessors, (68), 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 43 [2024-11-18 13:10:26,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:10:26,204 INFO L225 Difference]: With dead ends: 143 [2024-11-18 13:10:26,204 INFO L226 Difference]: Without dead ends: 135 [2024-11-18 13:10:26,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2223 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=659, Invalid=10437, Unknown=34, NotChecked=0, Total=11130 [2024-11-18 13:10:26,211 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 128 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 1508 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-18 13:10:26,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 560 Invalid, 1532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1508 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-18 13:10:26,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-18 13:10:26,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 98. [2024-11-18 13:10:26,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 87 states have (on average 1.1954022988505748) internal successors, (104), 87 states have internal predecessors, (104), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-18 13:10:26,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2024-11-18 13:10:26,245 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 43 [2024-11-18 13:10:26,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:10:26,245 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2024-11-18 13:10:26,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 50 states have (on average 1.36) internal successors, (68), 44 states have internal predecessors, (68), 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) [2024-11-18 13:10:26,246 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2024-11-18 13:10:26,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-18 13:10:26,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:26,250 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 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] [2024-11-18 13:10:26,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-18 13:10:26,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:10:26,451 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:26,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:26,452 INFO L85 PathProgramCache]: Analyzing trace with hash -974162385, now seen corresponding path program 3 times [2024-11-18 13:10:26,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:26,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955879174] [2024-11-18 13:10:26,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 13:10:26,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:26,501 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-18 13:10:26,502 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:10:29,335 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:10:29,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:29,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955879174] [2024-11-18 13:10:29,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955879174] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:29,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789518003] [2024-11-18 13:10:29,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 13:10:29,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:10:29,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:10:29,337 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) [2024-11-18 13:10:29,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-18 13:10:29,800 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-18 13:10:29,801 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:10:29,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 170 conjuncts are in the unsatisfiable core [2024-11-18 13:10:29,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:10:29,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-18 13:10:30,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:10:30,057 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 4) 1) (= |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|) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0)))) is different from false [2024-11-18 13:10:30,059 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 4) 1) (= |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|) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0)))) is different from true [2024-11-18 13:10:30,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:10:30,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:10:30,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-18 13:10:30,092 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) 1) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 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)) is different from false [2024-11-18 13:10:30,094 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) 1) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 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)) is different from true [2024-11-18 13:10:30,147 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-18 13:10:30,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 42 [2024-11-18 13:10:30,165 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-18 13:10:30,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2024-11-18 13:10:30,178 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-18 13:10:30,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2024-11-18 13:10:30,191 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.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) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (or (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)))) is different from false [2024-11-18 13:10:30,193 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.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) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (or (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)))) is different from true [2024-11-18 13:10:30,229 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 1))) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 .cse2) (= (select (select |c_#memory_int#1| .cse0) 4) 1)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) is different from false [2024-11-18 13:10:30,232 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 1))) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 .cse2) (= (select (select |c_#memory_int#1| .cse0) 4) 1)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) is different from true [2024-11-18 13:10:30,257 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-18 13:10:30,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 42 [2024-11-18 13:10:30,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-18 13:10:30,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:10:30,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-18 13:10:30,284 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimIndex_11 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_11) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))))) is different from false [2024-11-18 13:10:30,286 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimIndex_11 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_11) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))))) is different from true [2024-11-18 13:10:30,310 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimIndex_11 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_11) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))))) is different from false [2024-11-18 13:10:30,311 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimIndex_11 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_11) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))))) is different from true [2024-11-18 13:10:30,351 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimIndex_11 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_11) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))))) is different from false [2024-11-18 13:10:30,353 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimIndex_11 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_11) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))))) is different from true [2024-11-18 13:10:30,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:10:30,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2024-11-18 13:10:30,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:10:30,451 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-18 13:10:30,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 66 [2024-11-18 13:10:30,492 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2024-11-18 13:10:30,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 73 [2024-11-18 13:10:30,540 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_18| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_18|))) (store |v_#valid_BEFORE_CALL_21| .cse2 (select |v_old(#valid)_AFTER_CALL_18| .cse2))) |v_old(#valid)_AFTER_CALL_18|))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| .cse1))) (let ((.cse3 (= .cse1 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (.cse4 (= (select .cse5 0) 0))) (or (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| .cse0))) (and (or .cse3 .cse4 (= .cse5 .cse6)) (= (select .cse6 0) 0))) (and (or .cse3 .cse4) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse0))))) (= .cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#1| .cse1) 4) 1)) (= |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_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimIndex_11 Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse7 (select |v_#valid_BEFORE_CALL_19| .cse7)))) (= (select |v_#valid_BEFORE_CALL_18| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_11) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))))))) is different from false [2024-11-18 13:10:30,542 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_18| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_18|))) (store |v_#valid_BEFORE_CALL_21| .cse2 (select |v_old(#valid)_AFTER_CALL_18| .cse2))) |v_old(#valid)_AFTER_CALL_18|))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| .cse1))) (let ((.cse3 (= .cse1 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (.cse4 (= (select .cse5 0) 0))) (or (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| .cse0))) (and (or .cse3 .cse4 (= .cse5 .cse6)) (= (select .cse6 0) 0))) (and (or .cse3 .cse4) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse0))))) (= .cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#1| .cse1) 4) 1)) (= |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_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimIndex_11 Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse7 (select |v_#valid_BEFORE_CALL_19| .cse7)))) (= (select |v_#valid_BEFORE_CALL_18| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_11) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))))))) is different from true [2024-11-18 13:10:30,631 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse0 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) (or (and .cse0 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse1)) (and .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#1| .cse2) 4) 1)) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_18| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_18|))) (store |v_#valid_BEFORE_CALL_21| .cse3 (select |v_old(#valid)_AFTER_CALL_18| .cse3))) |v_old(#valid)_AFTER_CALL_18|))) (= |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_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimIndex_11 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse4 (select |v_#valid_BEFORE_CALL_19| .cse4)))) (= (select |v_#valid_BEFORE_CALL_18| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_11) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))))))) is different from false [2024-11-18 13:10:30,637 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse0 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) (or (and .cse0 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse1)) (and .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#1| .cse2) 4) 1)) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_18| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_18|))) (store |v_#valid_BEFORE_CALL_21| .cse3 (select |v_old(#valid)_AFTER_CALL_18| .cse3))) |v_old(#valid)_AFTER_CALL_18|))) (= |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_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimIndex_11 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse4 (select |v_#valid_BEFORE_CALL_19| .cse4)))) (= (select |v_#valid_BEFORE_CALL_18| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_11) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))))))) is different from true [2024-11-18 13:10:30,745 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse0 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) (or (and .cse0 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse1)) (and .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#1| .cse2) 4) 1)) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_18| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_18|))) (store |v_#valid_BEFORE_CALL_21| .cse3 (select |v_old(#valid)_AFTER_CALL_18| .cse3))) |v_old(#valid)_AFTER_CALL_18|))) (= |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_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimIndex_11 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse4 (select |v_#valid_BEFORE_CALL_19| .cse4)))) (= (select |v_#valid_BEFORE_CALL_18| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_11) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))))))) is different from false [2024-11-18 13:10:30,748 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse0 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) (or (and .cse0 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse1)) (and .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#1| .cse2) 4) 1)) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_18| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_18|))) (store |v_#valid_BEFORE_CALL_21| .cse3 (select |v_old(#valid)_AFTER_CALL_18| .cse3))) |v_old(#valid)_AFTER_CALL_18|))) (= |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_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimIndex_11 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse4 (select |v_#valid_BEFORE_CALL_19| .cse4)))) (= (select |v_#valid_BEFORE_CALL_18| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_11) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))))))) is different from true [2024-11-18 13:10:30,950 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse0 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) (or (and .cse0 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse1)) (and .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#1| .cse2) 4) 1)) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_18| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse2) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_18|))) (store |v_#valid_BEFORE_CALL_21| .cse5 (select |v_old(#valid)_AFTER_CALL_18| .cse5))) |v_old(#valid)_AFTER_CALL_18|))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimIndex_11 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse6 (select |v_#valid_BEFORE_CALL_19| .cse6)))) (= (select |v_#valid_BEFORE_CALL_18| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_11) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))))))) is different from false [2024-11-18 13:10:30,955 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse0 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) (or (and .cse0 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse1)) (and .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#1| .cse2) 4) 1)) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_18| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse2) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_18|))) (store |v_#valid_BEFORE_CALL_21| .cse5 (select |v_old(#valid)_AFTER_CALL_18| .cse5))) |v_old(#valid)_AFTER_CALL_18|))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimIndex_11 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse6 (select |v_#valid_BEFORE_CALL_19| .cse6)))) (= (select |v_#valid_BEFORE_CALL_18| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_11) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))))))) is different from true [2024-11-18 13:10:31,178 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse8) .cse9)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse8) .cse9))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse0 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) (or (and .cse0 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse1)) (and .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#1| .cse2) 4) 1)) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_18| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse2) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_18|))) (store |v_#valid_BEFORE_CALL_21| .cse5 (select |v_old(#valid)_AFTER_CALL_18| .cse5))) |v_old(#valid)_AFTER_CALL_18|))) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |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_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimIndex_11 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse6 (select |v_#valid_BEFORE_CALL_19| .cse6)))) (= (select |v_#valid_BEFORE_CALL_18| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_11) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))))))) is different from false [2024-11-18 13:10:31,181 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse8) .cse9)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse8) .cse9))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse0 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) (or (and .cse0 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse1)) (and .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#1| .cse2) 4) 1)) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_18| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse2) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_18|))) (store |v_#valid_BEFORE_CALL_21| .cse5 (select |v_old(#valid)_AFTER_CALL_18| .cse5))) |v_old(#valid)_AFTER_CALL_18|))) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |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_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimIndex_11 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse6 (select |v_#valid_BEFORE_CALL_19| .cse6)))) (= (select |v_#valid_BEFORE_CALL_18| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_11) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))))))) is different from true [2024-11-18 13:10:31,303 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse6) .cse7)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse6) .cse7))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse0 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) (or (and .cse0 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse1)) (and .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#1| .cse2) 4) 1)) (= (select (select |c_#memory_$Pointer$#1.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_#t~mem12#1.offset|) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_18| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse2) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_18|))) (store |v_#valid_BEFORE_CALL_21| .cse5 (select |v_old(#valid)_AFTER_CALL_18| .cse5))) |v_old(#valid)_AFTER_CALL_18|))) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| .cse6) (= .cse7 |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset|) (= (select (select |c_#memory_$Pointer$#1.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_#t~mem12#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimIndex_11 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse8 (select |v_#valid_BEFORE_CALL_19| .cse8)))) (= (select |v_#valid_BEFORE_CALL_18| .cse9) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_11) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))))))) is different from false [2024-11-18 13:10:31,306 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse6) .cse7)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse6) .cse7))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse0 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) (or (and .cse0 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse1)) (and .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#1| .cse2) 4) 1)) (= (select (select |c_#memory_$Pointer$#1.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_#t~mem12#1.offset|) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_18| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse2) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_18|))) (store |v_#valid_BEFORE_CALL_21| .cse5 (select |v_old(#valid)_AFTER_CALL_18| .cse5))) |v_old(#valid)_AFTER_CALL_18|))) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| .cse6) (= .cse7 |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset|) (= (select (select |c_#memory_$Pointer$#1.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_#t~mem12#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimIndex_11 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse8 (select |v_#valid_BEFORE_CALL_19| .cse8)))) (= (select |v_#valid_BEFORE_CALL_18| .cse9) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_11) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))))))) is different from true [2024-11-18 13:10:31,350 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:10:31,351 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:10:31,352 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:10:31,388 INFO L349 Elim1Store]: treesize reduction 32, result has 74.4 percent of original size [2024-11-18 13:10:31,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 331 treesize of output 220 [2024-11-18 13:10:32,528 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse54 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse23 (select (select |c_#memory_$Pointer$#1.base| .cse54) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse21 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse4 (select .cse21 .cse9))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse34 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse18 (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| 0)) (.cse52 (select |c_#memory_$Pointer$#1.base| .cse34))) (let ((.cse7 (or (exists ((v_arrayElimCell_127 Int)) (= (select .cse52 v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse55 (select .cse52 v_arrayElimCell_127))) (and (not (= .cse55 .cse2)) (= .cse55 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))))) (.cse22 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse23)) (.cse0 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse54)) (.cse6 (not (= .cse4 .cse34))) (.cse8 (not .cse18)) (.cse25 (or (exists ((v_arrayElimCell_127 Int)) (and (= (select .cse52 v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))) (exists ((v_arrayElimCell_127 Int)) (let ((.cse53 (select .cse52 v_arrayElimCell_127))) (and (not (= .cse53 .cse2)) (= .cse53 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))))) (.cse11 (not (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse9)))) (or (and .cse0 (or (exists ((v_arrayElimIndex_15 Int)) (let ((.cse1 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse1 .cse2)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse1) v_arrayElimCell_127))) (and (not (= .cse2 .cse3)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse3)))) (not (= .cse1 .cse4))))) (and .cse6 .cse7 .cse8) (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse10 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse9 v_arrayElimCell_127)) (not (= v_arrayElimIndex_15 0)) (not (= .cse10 .cse4)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse10) v_arrayElimCell_127))))) .cse11) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse13 (select .cse5 v_arrayElimIndex_15))) (and (exists ((v_arrayElimCell_127 Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| .cse13) v_arrayElimCell_127))) (and (not (= .cse9 v_arrayElimCell_127)) (not (= .cse2 .cse12)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse12)))) (not (= v_arrayElimIndex_15 0)) (not (= .cse13 .cse4))))) (and .cse11 (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse14 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse14 .cse2)) (not (= .cse14 .cse4)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse14) v_arrayElimCell_127)))))))) (and .cse0 (or (and .cse11 (exists ((v_arrayElimIndex_15 Int)) (let ((.cse15 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse15 .cse2)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse15) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))))) (and (exists ((v_arrayElimIndex_15 Int)) (and (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| (select .cse5 v_arrayElimIndex_15)) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (not (= v_arrayElimIndex_15 0)))) .cse11) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse16 (select .cse5 v_arrayElimIndex_15))) (let ((.cse17 (select (select |c_#memory_$Pointer$#1.base| .cse16) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (and (not (= .cse16 .cse2)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse17) (not (= .cse2 .cse17)))))))) (and (let ((.cse19 (select |c_#memory_$Pointer$#1.base| (select .cse5 0)))) (or (and .cse18 (= (select .cse19 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (and (or (exists ((v_arrayElimCell_127 Int)) (let ((.cse20 (select .cse19 v_arrayElimCell_127))) (and (= .cse20 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= .cse20 .cse2)) (not (= v_arrayElimCell_127 0))))) (and .cse18 (exists ((v_arrayElimCell_127 Int)) (and (= (select .cse19 v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| (select .cse21 0)) 0)) v_arrayElimCell_127) .cse2))))) (and .cse11 (exists ((v_arrayElimCell_127 Int)) (and (= (select .cse19 v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))))) .cse22))) (not (= .cse2 .cse23))) (and .cse0 (or (exists ((v_arrayElimIndex_15 Int)) (and (not (= v_arrayElimIndex_15 0)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse24 (select (select |c_#memory_$Pointer$#1.base| (select .cse5 v_arrayElimIndex_15)) v_arrayElimCell_127))) (and (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= .cse2 .cse24)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse24) (not (= v_arrayElimCell_127 0))))))) (and .cse8 .cse25) (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (and (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= v_arrayElimIndex_15 0)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| (select .cse5 v_arrayElimIndex_15)) v_arrayElimCell_127)) (not (= v_arrayElimCell_127 0)))) .cse11) (and .cse11 (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse26 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse26 .cse2)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse26) v_arrayElimCell_127)) (not (= v_arrayElimCell_127 0)))))) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse27 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse27 .cse2)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse28 (select (select |c_#memory_$Pointer$#1.base| .cse27) v_arrayElimCell_127))) (and (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= .cse2 .cse28)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse28) (not (= v_arrayElimCell_127 0)))))))))) (and .cse0 (or (exists ((v_arrayElimIndex_15 Int)) (and (not (= v_arrayElimIndex_15 0)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse29 (select (select |c_#memory_$Pointer$#1.base| (select .cse5 v_arrayElimIndex_15)) v_arrayElimCell_127))) (and (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= .cse9 v_arrayElimCell_127)) (not (= .cse2 .cse29)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse29)))))) (and .cse11 (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse30 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse30 .cse2)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse30) v_arrayElimCell_127)))))) (and .cse7 .cse8) (and .cse11 (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (and (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= .cse9 v_arrayElimCell_127)) (not (= v_arrayElimIndex_15 0)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| (select .cse5 v_arrayElimIndex_15)) v_arrayElimCell_127))))) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse31 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse31 .cse2)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse32 (select (select |c_#memory_$Pointer$#1.base| .cse31) v_arrayElimCell_127))) (and (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= .cse2 .cse32)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse32)))))))) .cse22) (and .cse0 (or (and .cse11 (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse33 (select .cse5 v_arrayElimIndex_15))) (and (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= .cse9 v_arrayElimCell_127)) (not (= v_arrayElimIndex_15 0)) (not (= .cse33 .cse23)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse33) v_arrayElimCell_127)))))) (and (not (= .cse34 .cse23)) .cse7 .cse8) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse36 (select .cse5 v_arrayElimIndex_15))) (and (not (= v_arrayElimIndex_15 0)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse35 (select (select |c_#memory_$Pointer$#1.base| .cse36) v_arrayElimCell_127))) (and (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= .cse9 v_arrayElimCell_127)) (not (= .cse2 .cse35)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse35)))) (not (= .cse36 .cse23))))) (and .cse11 (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse37 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse37 .cse2)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= .cse37 .cse23)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse37) v_arrayElimCell_127)))))) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse38 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse38 .cse2)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse39 (select (select |c_#memory_$Pointer$#1.base| .cse38) v_arrayElimCell_127))) (and (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= .cse2 .cse39)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse39)))) (not (= .cse38 .cse23))))))) (and .cse0 (or (and .cse11 (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse40 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse40 .cse4)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse40) v_arrayElimCell_127)))))) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse42 (select .cse5 v_arrayElimIndex_15))) (and (exists ((v_arrayElimCell_127 Int)) (let ((.cse41 (select (select |c_#memory_$Pointer$#1.base| .cse42) v_arrayElimCell_127))) (and (not (= .cse9 v_arrayElimCell_127)) (not (= .cse2 .cse41)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse41)))) (not (= .cse42 .cse4))))) (and .cse6 .cse7) (and .cse11 (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse43 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse9 v_arrayElimCell_127)) (not (= .cse43 .cse4)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse43) v_arrayElimCell_127)))))) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse45 (select .cse5 v_arrayElimIndex_15))) (and (exists ((v_arrayElimCell_127 Int)) (let ((.cse44 (select (select |c_#memory_$Pointer$#1.base| .cse45) v_arrayElimCell_127))) (and (not (= .cse2 .cse44)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse44)))) (not (= .cse45 .cse4)))))) .cse22) (and .cse0 (or (and .cse11 (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse46 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse46 .cse2)) (not (= .cse46 .cse4)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse46) v_arrayElimCell_127)) (not (= v_arrayElimCell_127 0)))))) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse47 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse47 .cse2)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse48 (select (select |c_#memory_$Pointer$#1.base| .cse47) v_arrayElimCell_127))) (and (not (= .cse2 .cse48)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse48) (not (= v_arrayElimCell_127 0))))) (not (= .cse47 .cse4))))) (and .cse6 .cse8 .cse25) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse50 (select .cse5 v_arrayElimIndex_15))) (and (exists ((v_arrayElimCell_127 Int)) (let ((.cse49 (select (select |c_#memory_$Pointer$#1.base| .cse50) v_arrayElimCell_127))) (and (not (= .cse2 .cse49)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse49) (not (= v_arrayElimCell_127 0))))) (not (= v_arrayElimIndex_15 0)) (not (= .cse50 .cse4))))) (and .cse11 (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse51 (select .cse5 v_arrayElimIndex_15))) (and (not (= v_arrayElimIndex_15 0)) (not (= .cse51 .cse4)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse51) v_arrayElimCell_127)) (not (= v_arrayElimCell_127 0)))))))))))))))) (= .cse54 (select (select |c_#memory_$Pointer$#1.base| .cse23) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse54 .cse23) (= (select (select |c_#memory_int#1| .cse54) 4) 1)) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse23) 1) (= (select |v_old(#valid)_AFTER_CALL_18| .cse54) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse54) 0) (= (let ((.cse56 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_18|))) (store |v_#valid_BEFORE_CALL_21| .cse56 (select |v_old(#valid)_AFTER_CALL_18| .cse56))) |v_old(#valid)_AFTER_CALL_18|))) (= |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_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimIndex_11 Int)) (let ((.cse58 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse57 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse57 (select |v_#valid_BEFORE_CALL_19| .cse57)))) (= (select |v_#valid_BEFORE_CALL_18| .cse58) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse58) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_11) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))))))) is different from false [2024-11-18 13:10:32,536 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse54 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse23 (select (select |c_#memory_$Pointer$#1.base| .cse54) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse21 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse4 (select .cse21 .cse9))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse34 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse18 (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| 0)) (.cse52 (select |c_#memory_$Pointer$#1.base| .cse34))) (let ((.cse7 (or (exists ((v_arrayElimCell_127 Int)) (= (select .cse52 v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse55 (select .cse52 v_arrayElimCell_127))) (and (not (= .cse55 .cse2)) (= .cse55 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))))) (.cse22 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse23)) (.cse0 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse54)) (.cse6 (not (= .cse4 .cse34))) (.cse8 (not .cse18)) (.cse25 (or (exists ((v_arrayElimCell_127 Int)) (and (= (select .cse52 v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))) (exists ((v_arrayElimCell_127 Int)) (let ((.cse53 (select .cse52 v_arrayElimCell_127))) (and (not (= .cse53 .cse2)) (= .cse53 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))))) (.cse11 (not (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse9)))) (or (and .cse0 (or (exists ((v_arrayElimIndex_15 Int)) (let ((.cse1 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse1 .cse2)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse1) v_arrayElimCell_127))) (and (not (= .cse2 .cse3)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse3)))) (not (= .cse1 .cse4))))) (and .cse6 .cse7 .cse8) (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse10 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse9 v_arrayElimCell_127)) (not (= v_arrayElimIndex_15 0)) (not (= .cse10 .cse4)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse10) v_arrayElimCell_127))))) .cse11) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse13 (select .cse5 v_arrayElimIndex_15))) (and (exists ((v_arrayElimCell_127 Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| .cse13) v_arrayElimCell_127))) (and (not (= .cse9 v_arrayElimCell_127)) (not (= .cse2 .cse12)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse12)))) (not (= v_arrayElimIndex_15 0)) (not (= .cse13 .cse4))))) (and .cse11 (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse14 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse14 .cse2)) (not (= .cse14 .cse4)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse14) v_arrayElimCell_127)))))))) (and .cse0 (or (and .cse11 (exists ((v_arrayElimIndex_15 Int)) (let ((.cse15 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse15 .cse2)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse15) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))))) (and (exists ((v_arrayElimIndex_15 Int)) (and (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| (select .cse5 v_arrayElimIndex_15)) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (not (= v_arrayElimIndex_15 0)))) .cse11) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse16 (select .cse5 v_arrayElimIndex_15))) (let ((.cse17 (select (select |c_#memory_$Pointer$#1.base| .cse16) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (and (not (= .cse16 .cse2)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse17) (not (= .cse2 .cse17)))))))) (and (let ((.cse19 (select |c_#memory_$Pointer$#1.base| (select .cse5 0)))) (or (and .cse18 (= (select .cse19 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (and (or (exists ((v_arrayElimCell_127 Int)) (let ((.cse20 (select .cse19 v_arrayElimCell_127))) (and (= .cse20 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= .cse20 .cse2)) (not (= v_arrayElimCell_127 0))))) (and .cse18 (exists ((v_arrayElimCell_127 Int)) (and (= (select .cse19 v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| (select .cse21 0)) 0)) v_arrayElimCell_127) .cse2))))) (and .cse11 (exists ((v_arrayElimCell_127 Int)) (and (= (select .cse19 v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))))) .cse22))) (not (= .cse2 .cse23))) (and .cse0 (or (exists ((v_arrayElimIndex_15 Int)) (and (not (= v_arrayElimIndex_15 0)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse24 (select (select |c_#memory_$Pointer$#1.base| (select .cse5 v_arrayElimIndex_15)) v_arrayElimCell_127))) (and (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= .cse2 .cse24)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse24) (not (= v_arrayElimCell_127 0))))))) (and .cse8 .cse25) (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (and (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= v_arrayElimIndex_15 0)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| (select .cse5 v_arrayElimIndex_15)) v_arrayElimCell_127)) (not (= v_arrayElimCell_127 0)))) .cse11) (and .cse11 (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse26 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse26 .cse2)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse26) v_arrayElimCell_127)) (not (= v_arrayElimCell_127 0)))))) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse27 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse27 .cse2)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse28 (select (select |c_#memory_$Pointer$#1.base| .cse27) v_arrayElimCell_127))) (and (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= .cse2 .cse28)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse28) (not (= v_arrayElimCell_127 0)))))))))) (and .cse0 (or (exists ((v_arrayElimIndex_15 Int)) (and (not (= v_arrayElimIndex_15 0)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse29 (select (select |c_#memory_$Pointer$#1.base| (select .cse5 v_arrayElimIndex_15)) v_arrayElimCell_127))) (and (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= .cse9 v_arrayElimCell_127)) (not (= .cse2 .cse29)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse29)))))) (and .cse11 (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse30 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse30 .cse2)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse30) v_arrayElimCell_127)))))) (and .cse7 .cse8) (and .cse11 (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (and (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= .cse9 v_arrayElimCell_127)) (not (= v_arrayElimIndex_15 0)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| (select .cse5 v_arrayElimIndex_15)) v_arrayElimCell_127))))) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse31 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse31 .cse2)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse32 (select (select |c_#memory_$Pointer$#1.base| .cse31) v_arrayElimCell_127))) (and (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= .cse2 .cse32)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse32)))))))) .cse22) (and .cse0 (or (and .cse11 (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse33 (select .cse5 v_arrayElimIndex_15))) (and (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= .cse9 v_arrayElimCell_127)) (not (= v_arrayElimIndex_15 0)) (not (= .cse33 .cse23)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse33) v_arrayElimCell_127)))))) (and (not (= .cse34 .cse23)) .cse7 .cse8) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse36 (select .cse5 v_arrayElimIndex_15))) (and (not (= v_arrayElimIndex_15 0)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse35 (select (select |c_#memory_$Pointer$#1.base| .cse36) v_arrayElimCell_127))) (and (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= .cse9 v_arrayElimCell_127)) (not (= .cse2 .cse35)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse35)))) (not (= .cse36 .cse23))))) (and .cse11 (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse37 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse37 .cse2)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= .cse37 .cse23)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse37) v_arrayElimCell_127)))))) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse38 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse38 .cse2)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse39 (select (select |c_#memory_$Pointer$#1.base| .cse38) v_arrayElimCell_127))) (and (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= .cse2 .cse39)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse39)))) (not (= .cse38 .cse23))))))) (and .cse0 (or (and .cse11 (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse40 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse40 .cse4)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse40) v_arrayElimCell_127)))))) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse42 (select .cse5 v_arrayElimIndex_15))) (and (exists ((v_arrayElimCell_127 Int)) (let ((.cse41 (select (select |c_#memory_$Pointer$#1.base| .cse42) v_arrayElimCell_127))) (and (not (= .cse9 v_arrayElimCell_127)) (not (= .cse2 .cse41)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse41)))) (not (= .cse42 .cse4))))) (and .cse6 .cse7) (and .cse11 (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse43 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse9 v_arrayElimCell_127)) (not (= .cse43 .cse4)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse43) v_arrayElimCell_127)))))) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse45 (select .cse5 v_arrayElimIndex_15))) (and (exists ((v_arrayElimCell_127 Int)) (let ((.cse44 (select (select |c_#memory_$Pointer$#1.base| .cse45) v_arrayElimCell_127))) (and (not (= .cse2 .cse44)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse44)))) (not (= .cse45 .cse4)))))) .cse22) (and .cse0 (or (and .cse11 (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse46 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse46 .cse2)) (not (= .cse46 .cse4)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse46) v_arrayElimCell_127)) (not (= v_arrayElimCell_127 0)))))) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse47 (select .cse5 v_arrayElimIndex_15))) (and (not (= .cse47 .cse2)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse48 (select (select |c_#memory_$Pointer$#1.base| .cse47) v_arrayElimCell_127))) (and (not (= .cse2 .cse48)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse48) (not (= v_arrayElimCell_127 0))))) (not (= .cse47 .cse4))))) (and .cse6 .cse8 .cse25) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse50 (select .cse5 v_arrayElimIndex_15))) (and (exists ((v_arrayElimCell_127 Int)) (let ((.cse49 (select (select |c_#memory_$Pointer$#1.base| .cse50) v_arrayElimCell_127))) (and (not (= .cse2 .cse49)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse49) (not (= v_arrayElimCell_127 0))))) (not (= v_arrayElimIndex_15 0)) (not (= .cse50 .cse4))))) (and .cse11 (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse51 (select .cse5 v_arrayElimIndex_15))) (and (not (= v_arrayElimIndex_15 0)) (not (= .cse51 .cse4)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse51) v_arrayElimCell_127)) (not (= v_arrayElimCell_127 0)))))))))))))))) (= .cse54 (select (select |c_#memory_$Pointer$#1.base| .cse23) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse54 .cse23) (= (select (select |c_#memory_int#1| .cse54) 4) 1)) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse23) 1) (= (select |v_old(#valid)_AFTER_CALL_18| .cse54) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse54) 0) (= (let ((.cse56 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_18|))) (store |v_#valid_BEFORE_CALL_21| .cse56 (select |v_old(#valid)_AFTER_CALL_18| .cse56))) |v_old(#valid)_AFTER_CALL_18|))) (= |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_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimIndex_11 Int)) (let ((.cse58 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse57 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse57 (select |v_#valid_BEFORE_CALL_19| .cse57)))) (= (select |v_#valid_BEFORE_CALL_18| .cse58) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse58) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_11) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))))))) is different from true [2024-11-18 13:10:33,541 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse20 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse20))) (let ((.cse7 (select .cse12 0)) (.cse8 (= .cse4 .cse20))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse54 (select .cse12 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse5 (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| 0)) (.cse50 (select |c_#memory_$Pointer$#1.base| .cse54))) (let ((.cse17 (not (= .cse54 .cse20))) (.cse18 (or (exists ((v_arrayElimCell_127 Int)) (let ((.cse53 (select .cse50 v_arrayElimCell_127))) (and (= .cse53 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= .cse53 .cse4))))) (exists ((v_arrayElimCell_127 Int)) (= (select .cse50 v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) (.cse1 (not .cse5))) (let ((.cse10 (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (and (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= v_arrayElimIndex_15 0)) (= (select (select |c_#memory_$Pointer$#1.base| (select .cse12 v_arrayElimIndex_15)) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))) .cse1)) (.cse14 (exists ((v_arrayElimIndex_15 Int)) (and (exists ((v_arrayElimCell_127 Int)) (let ((.cse52 (select (select |c_#memory_$Pointer$#1.base| (select .cse12 v_arrayElimIndex_15)) v_arrayElimCell_127))) (and (not (= .cse4 .cse52)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= .cse52 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) (not (= v_arrayElimIndex_15 0))))) (.cse0 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse20)) (.cse13 (or (exists ((v_arrayElimCell_127 Int)) (and (= (select .cse50 v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))) (exists ((v_arrayElimCell_127 Int)) (let ((.cse51 (select .cse50 v_arrayElimCell_127))) (and (= .cse51 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= .cse51 .cse4)) (not (= v_arrayElimCell_127 0))))))) (.cse32 (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse49 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse49 .cse20)) (not (= v_arrayElimIndex_15 0)) (= (select (select |c_#memory_$Pointer$#1.base| .cse49) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) .cse1)) (.cse36 (exists ((v_arrayElimIndex_15 Int)) (let ((.cse47 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse47 .cse20)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse48 (select (select |c_#memory_$Pointer$#1.base| .cse47) v_arrayElimCell_127))) (and (not (= .cse4 .cse48)) (= .cse48 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) (not (= v_arrayElimIndex_15 0)))))) (.cse9 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse4)) (.cse37 (and .cse17 .cse1 .cse18))) (or (and (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse7))) (or (and .cse0 (or (and .cse1 (exists ((v_arrayElimCell_127 Int)) (and (= (select .cse2 v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) (and (exists ((v_arrayElimCell_127 Int)) (let ((.cse3 (select .cse2 v_arrayElimCell_127))) (and (not (= .cse3 .cse4)) (= .cse3 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) .cse5) (exists ((v_arrayElimCell_127 Int)) (let ((.cse6 (select .cse2 v_arrayElimCell_127))) (and (not (= .cse6 .cse4)) (= .cse6 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))))) (and .cse5 (= (select .cse2 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) (not .cse8)) (and .cse9 (or .cse10 (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse11 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse4 .cse11)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= (select (select |c_#memory_$Pointer$#1.base| .cse11) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) .cse1) (and .cse13 .cse1) .cse14 (exists ((v_arrayElimIndex_15 Int)) (let ((.cse15 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse4 .cse15)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse16 (select (select |c_#memory_$Pointer$#1.base| .cse15) v_arrayElimCell_127))) (and (not (= .cse4 .cse16)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= .cse16 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))))))))) (and .cse9 .cse0 (or (and .cse17 .cse18) (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse19 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse19 .cse20)) (= (select (select |c_#memory_$Pointer$#1.base| .cse19) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) .cse1) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse21 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse21 .cse20)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse22 (select (select |c_#memory_$Pointer$#1.base| .cse21) v_arrayElimCell_127))) (and (not (= .cse4 .cse22)) (= .cse22 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))))) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse23 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse23 .cse20)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse24 (select (select |c_#memory_$Pointer$#1.base| .cse23) v_arrayElimCell_127))) (and (not (= .cse4 .cse24)) (= .cse24 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))))))) (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse25 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse25 .cse20)) (= (select (select |c_#memory_$Pointer$#1.base| .cse25) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) .cse1))) (and .cse9 (or (and .cse1 (exists ((v_arrayElimIndex_15 Int)) (let ((.cse26 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse4 .cse26)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse26) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))))) (and (exists ((v_arrayElimIndex_15 Int)) (and (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| (select .cse12 v_arrayElimIndex_15)) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (not (= v_arrayElimIndex_15 0)))) .cse1) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse27 (select .cse12 v_arrayElimIndex_15))) (let ((.cse28 (select (select |c_#memory_$Pointer$#1.base| .cse27) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (and (not (= .cse4 .cse27)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse28) (not (= .cse4 .cse28)))))))) (and .cse9 (or (and .cse1 .cse18) .cse10 (exists ((v_arrayElimIndex_15 Int)) (let ((.cse29 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse4 .cse29)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse30 (select (select |c_#memory_$Pointer$#1.base| .cse29) v_arrayElimCell_127))) (and (not (= .cse4 .cse30)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= .cse30 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))))) (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse31 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse4 .cse31)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= (select (select |c_#memory_$Pointer$#1.base| .cse31) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) .cse1) .cse14) .cse0) (and .cse9 (or .cse32 (and .cse1 (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse33 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse4 .cse33)) (not (= .cse33 .cse20)) (= (select (select |c_#memory_$Pointer$#1.base| .cse33) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))))) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse34 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse4 .cse34)) (not (= .cse34 .cse20)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse35 (select (select |c_#memory_$Pointer$#1.base| .cse34) v_arrayElimCell_127))) (and (not (= .cse4 .cse35)) (= .cse35 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))))))) .cse36 (and .cse17 .cse13 .cse1))) (and .cse9 (or .cse32 .cse37 (exists ((v_arrayElimIndex_15 Int)) (let ((.cse38 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse4 .cse38)) (not (= .cse38 .cse20)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse39 (select (select |c_#memory_$Pointer$#1.base| .cse38) v_arrayElimCell_127))) (and (not (= .cse4 .cse39)) (= .cse39 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))))) .cse36 (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse40 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse4 .cse40)) (not (= .cse40 .cse20)) (= (select (select |c_#memory_$Pointer$#1.base| .cse40) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) .cse1))) (and .cse9 (or (exists ((v_arrayElimIndex_15 Int)) (let ((.cse41 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse4 .cse41)) (not (= .cse41 .cse20)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse42 (select (select |c_#memory_$Pointer$#1.base| .cse41) v_arrayElimCell_127))) (and (not (= .cse4 .cse42)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= .cse42 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))))) (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse43 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse4 .cse43)) (not (= .cse43 .cse20)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= (select (select |c_#memory_$Pointer$#1.base| .cse43) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) .cse1) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse44 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse44 .cse20)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse45 (select (select |c_#memory_$Pointer$#1.base| .cse44) v_arrayElimCell_127))) (and (not (= .cse4 .cse45)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= .cse45 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) (not (= v_arrayElimIndex_15 0))))) .cse37 (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse46 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse46 .cse20)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= v_arrayElimIndex_15 0)) (= (select (select |c_#memory_$Pointer$#1.base| .cse46) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) .cse1)))))))) (= .cse4 .cse7) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse8 (= (select (select |c_#memory_int#1| .cse4) 4) 1)) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| .cse4) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse20) 1) (= (select |v_old(#valid)_AFTER_CALL_18| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse4) 0) (= (let ((.cse55 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_18|))) (store |v_#valid_BEFORE_CALL_21| .cse55 (select |v_old(#valid)_AFTER_CALL_18| .cse55))) |v_old(#valid)_AFTER_CALL_18|))) (= (select (select |c_#memory_$Pointer$#1.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_#t~mem12#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimIndex_11 Int)) (let ((.cse57 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse56 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse56 (select |v_#valid_BEFORE_CALL_19| .cse56)))) (= (select |v_#valid_BEFORE_CALL_18| .cse57) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse57) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_11) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))))))))) is different from false [2024-11-18 13:10:33,558 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse20 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse20))) (let ((.cse7 (select .cse12 0)) (.cse8 (= .cse4 .cse20))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse54 (select .cse12 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse5 (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| 0)) (.cse50 (select |c_#memory_$Pointer$#1.base| .cse54))) (let ((.cse17 (not (= .cse54 .cse20))) (.cse18 (or (exists ((v_arrayElimCell_127 Int)) (let ((.cse53 (select .cse50 v_arrayElimCell_127))) (and (= .cse53 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= .cse53 .cse4))))) (exists ((v_arrayElimCell_127 Int)) (= (select .cse50 v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) (.cse1 (not .cse5))) (let ((.cse10 (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (and (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= v_arrayElimIndex_15 0)) (= (select (select |c_#memory_$Pointer$#1.base| (select .cse12 v_arrayElimIndex_15)) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))) .cse1)) (.cse14 (exists ((v_arrayElimIndex_15 Int)) (and (exists ((v_arrayElimCell_127 Int)) (let ((.cse52 (select (select |c_#memory_$Pointer$#1.base| (select .cse12 v_arrayElimIndex_15)) v_arrayElimCell_127))) (and (not (= .cse4 .cse52)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= .cse52 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) (not (= v_arrayElimIndex_15 0))))) (.cse0 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse20)) (.cse13 (or (exists ((v_arrayElimCell_127 Int)) (and (= (select .cse50 v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))) (exists ((v_arrayElimCell_127 Int)) (let ((.cse51 (select .cse50 v_arrayElimCell_127))) (and (= .cse51 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= .cse51 .cse4)) (not (= v_arrayElimCell_127 0))))))) (.cse32 (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse49 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse49 .cse20)) (not (= v_arrayElimIndex_15 0)) (= (select (select |c_#memory_$Pointer$#1.base| .cse49) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) .cse1)) (.cse36 (exists ((v_arrayElimIndex_15 Int)) (let ((.cse47 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse47 .cse20)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse48 (select (select |c_#memory_$Pointer$#1.base| .cse47) v_arrayElimCell_127))) (and (not (= .cse4 .cse48)) (= .cse48 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) (not (= v_arrayElimIndex_15 0)))))) (.cse9 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse4)) (.cse37 (and .cse17 .cse1 .cse18))) (or (and (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse7))) (or (and .cse0 (or (and .cse1 (exists ((v_arrayElimCell_127 Int)) (and (= (select .cse2 v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) (and (exists ((v_arrayElimCell_127 Int)) (let ((.cse3 (select .cse2 v_arrayElimCell_127))) (and (not (= .cse3 .cse4)) (= .cse3 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) .cse5) (exists ((v_arrayElimCell_127 Int)) (let ((.cse6 (select .cse2 v_arrayElimCell_127))) (and (not (= .cse6 .cse4)) (= .cse6 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))))) (and .cse5 (= (select .cse2 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) (not .cse8)) (and .cse9 (or .cse10 (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse11 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse4 .cse11)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= (select (select |c_#memory_$Pointer$#1.base| .cse11) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) .cse1) (and .cse13 .cse1) .cse14 (exists ((v_arrayElimIndex_15 Int)) (let ((.cse15 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse4 .cse15)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse16 (select (select |c_#memory_$Pointer$#1.base| .cse15) v_arrayElimCell_127))) (and (not (= .cse4 .cse16)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= .cse16 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))))))))) (and .cse9 .cse0 (or (and .cse17 .cse18) (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse19 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse19 .cse20)) (= (select (select |c_#memory_$Pointer$#1.base| .cse19) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) .cse1) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse21 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse21 .cse20)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse22 (select (select |c_#memory_$Pointer$#1.base| .cse21) v_arrayElimCell_127))) (and (not (= .cse4 .cse22)) (= .cse22 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))))) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse23 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse23 .cse20)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse24 (select (select |c_#memory_$Pointer$#1.base| .cse23) v_arrayElimCell_127))) (and (not (= .cse4 .cse24)) (= .cse24 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))))))) (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse25 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse25 .cse20)) (= (select (select |c_#memory_$Pointer$#1.base| .cse25) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) .cse1))) (and .cse9 (or (and .cse1 (exists ((v_arrayElimIndex_15 Int)) (let ((.cse26 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse4 .cse26)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse26) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))))) (and (exists ((v_arrayElimIndex_15 Int)) (and (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| (select .cse12 v_arrayElimIndex_15)) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (not (= v_arrayElimIndex_15 0)))) .cse1) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse27 (select .cse12 v_arrayElimIndex_15))) (let ((.cse28 (select (select |c_#memory_$Pointer$#1.base| .cse27) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (and (not (= .cse4 .cse27)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse28) (not (= .cse4 .cse28)))))))) (and .cse9 (or (and .cse1 .cse18) .cse10 (exists ((v_arrayElimIndex_15 Int)) (let ((.cse29 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse4 .cse29)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse30 (select (select |c_#memory_$Pointer$#1.base| .cse29) v_arrayElimCell_127))) (and (not (= .cse4 .cse30)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= .cse30 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))))) (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse31 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse4 .cse31)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= (select (select |c_#memory_$Pointer$#1.base| .cse31) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) .cse1) .cse14) .cse0) (and .cse9 (or .cse32 (and .cse1 (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse33 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse4 .cse33)) (not (= .cse33 .cse20)) (= (select (select |c_#memory_$Pointer$#1.base| .cse33) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))))) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse34 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse4 .cse34)) (not (= .cse34 .cse20)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse35 (select (select |c_#memory_$Pointer$#1.base| .cse34) v_arrayElimCell_127))) (and (not (= .cse4 .cse35)) (= .cse35 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))))))) .cse36 (and .cse17 .cse13 .cse1))) (and .cse9 (or .cse32 .cse37 (exists ((v_arrayElimIndex_15 Int)) (let ((.cse38 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse4 .cse38)) (not (= .cse38 .cse20)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse39 (select (select |c_#memory_$Pointer$#1.base| .cse38) v_arrayElimCell_127))) (and (not (= .cse4 .cse39)) (= .cse39 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))))) .cse36 (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse40 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse4 .cse40)) (not (= .cse40 .cse20)) (= (select (select |c_#memory_$Pointer$#1.base| .cse40) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) .cse1))) (and .cse9 (or (exists ((v_arrayElimIndex_15 Int)) (let ((.cse41 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse4 .cse41)) (not (= .cse41 .cse20)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse42 (select (select |c_#memory_$Pointer$#1.base| .cse41) v_arrayElimCell_127))) (and (not (= .cse4 .cse42)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= .cse42 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))))) (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse43 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse4 .cse43)) (not (= .cse43 .cse20)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= (select (select |c_#memory_$Pointer$#1.base| .cse43) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) .cse1) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse44 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse44 .cse20)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse45 (select (select |c_#memory_$Pointer$#1.base| .cse44) v_arrayElimCell_127))) (and (not (= .cse4 .cse45)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= .cse45 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) (not (= v_arrayElimIndex_15 0))))) .cse37 (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse46 (select .cse12 v_arrayElimIndex_15))) (and (not (= .cse46 .cse20)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= v_arrayElimIndex_15 0)) (= (select (select |c_#memory_$Pointer$#1.base| .cse46) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) .cse1)))))))) (= .cse4 .cse7) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse8 (= (select (select |c_#memory_int#1| .cse4) 4) 1)) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| .cse4) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse20) 1) (= (select |v_old(#valid)_AFTER_CALL_18| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse4) 0) (= (let ((.cse55 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_18|))) (store |v_#valid_BEFORE_CALL_21| .cse55 (select |v_old(#valid)_AFTER_CALL_18| .cse55))) |v_old(#valid)_AFTER_CALL_18|))) (= (select (select |c_#memory_$Pointer$#1.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_#t~mem12#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimIndex_11 Int)) (let ((.cse57 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse56 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse56 (select |v_#valid_BEFORE_CALL_19| .cse56)))) (= (select |v_#valid_BEFORE_CALL_18| .cse57) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse57) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_11) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))))))))) is different from true [2024-11-18 13:10:34,427 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse14))) (let ((.cse30 (select .cse4 0)) (.cse31 (= .cse2 .cse14))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse54 (select .cse4 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse50 (select |c_#memory_$Pointer$#1.base| .cse54))) (let ((.cse28 (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| 0)) (.cse20 (exists ((v_arrayElimCell_127 Int)) (= (select .cse50 v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) (let ((.cse21 (not (= .cse54 .cse14))) (.cse23 (or (exists ((v_arrayElimCell_127 Int)) (let ((.cse53 (select .cse50 v_arrayElimCell_127))) (and (= .cse53 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= .cse53 .cse2))))) .cse20)) (.cse5 (not .cse28))) (let ((.cse1 (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (and (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= v_arrayElimIndex_15 0)) (= (select (select |c_#memory_$Pointer$#1.base| (select .cse4 v_arrayElimIndex_15)) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))) .cse5)) (.cse7 (exists ((v_arrayElimIndex_15 Int)) (and (exists ((v_arrayElimCell_127 Int)) (let ((.cse52 (select (select |c_#memory_$Pointer$#1.base| (select .cse4 v_arrayElimIndex_15)) v_arrayElimCell_127))) (and (not (= .cse2 .cse52)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= .cse52 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) (not (= v_arrayElimIndex_15 0))))) (.cse22 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse14)) (.cse6 (or (exists ((v_arrayElimCell_127 Int)) (and (= (select .cse50 v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))) (exists ((v_arrayElimCell_127 Int)) (let ((.cse51 (select .cse50 v_arrayElimCell_127))) (and (= .cse51 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= .cse51 .cse2)) (not (= v_arrayElimCell_127 0))))))) (.cse32 (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse49 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse49 .cse14)) (not (= v_arrayElimIndex_15 0)) (= (select (select |c_#memory_$Pointer$#1.base| .cse49) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) .cse5)) (.cse36 (exists ((v_arrayElimIndex_15 Int)) (let ((.cse47 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse47 .cse14)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse48 (select (select |c_#memory_$Pointer$#1.base| .cse47) v_arrayElimCell_127))) (and (not (= .cse2 .cse48)) (= .cse48 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) (not (= v_arrayElimIndex_15 0)))))) (.cse0 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2)) (.cse37 (and .cse21 .cse5 .cse23))) (or (and .cse0 (or .cse1 (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse3 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse2 .cse3)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) .cse5) (and .cse6 .cse5) .cse7 (exists ((v_arrayElimIndex_15 Int)) (let ((.cse8 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse2 .cse8)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| .cse8) v_arrayElimCell_127))) (and (not (= .cse2 .cse9)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= .cse9 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))))))))) (and .cse0 (or (and .cse5 (exists ((v_arrayElimIndex_15 Int)) (let ((.cse10 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse2 .cse10)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse10) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))))) (and (exists ((v_arrayElimIndex_15 Int)) (and (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| (select .cse4 v_arrayElimIndex_15)) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (not (= v_arrayElimIndex_15 0)))) .cse5) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse11 (select .cse4 v_arrayElimIndex_15))) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| .cse11) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (and (not (= .cse2 .cse11)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse12) (not (= .cse2 .cse12)))))))) (and .cse0 (or (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse13 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse13 .cse14)) (= (select (select |c_#memory_$Pointer$#1.base| .cse13) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) .cse5) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse15 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse15 .cse14)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse16 (select (select |c_#memory_$Pointer$#1.base| .cse15) v_arrayElimCell_127))) (and (not (= .cse2 .cse16)) (= .cse16 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))))) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse17 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse17 .cse14)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse18 (select (select |c_#memory_$Pointer$#1.base| .cse17) v_arrayElimCell_127))) (and (not (= .cse2 .cse18)) (= .cse18 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))))))) (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse19 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse19 .cse14)) (= (select (select |c_#memory_$Pointer$#1.base| .cse19) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) .cse5) (and .cse20 .cse21)) .cse22) (and .cse0 (or (and .cse5 .cse23) .cse1 (exists ((v_arrayElimIndex_15 Int)) (let ((.cse24 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse2 .cse24)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse25 (select (select |c_#memory_$Pointer$#1.base| .cse24) v_arrayElimCell_127))) (and (not (= .cse2 .cse25)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= .cse25 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))))) (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse26 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse2 .cse26)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= (select (select |c_#memory_$Pointer$#1.base| .cse26) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) .cse5) .cse7) .cse22) (and (let ((.cse27 (select |c_#memory_$Pointer$#1.base| .cse30))) (or (and .cse22 (or (and .cse5 (exists ((v_arrayElimCell_127 Int)) (and (= (select .cse27 v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) (and (exists ((v_arrayElimCell_127 Int)) (= (select .cse27 v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) .cse28) (exists ((v_arrayElimCell_127 Int)) (let ((.cse29 (select .cse27 v_arrayElimCell_127))) (and (not (= .cse29 .cse2)) (= .cse29 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))))) (and .cse28 (= (select .cse27 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) (not .cse31)) (and .cse0 (or .cse32 (and .cse5 (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse33 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse2 .cse33)) (not (= .cse33 .cse14)) (= (select (select |c_#memory_$Pointer$#1.base| .cse33) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))))) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse34 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse2 .cse34)) (not (= .cse34 .cse14)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse35 (select (select |c_#memory_$Pointer$#1.base| .cse34) v_arrayElimCell_127))) (and (not (= .cse2 .cse35)) (= .cse35 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))))))) .cse36 (and .cse21 .cse6 .cse5))) (and .cse0 (or .cse32 .cse37 (exists ((v_arrayElimIndex_15 Int)) (let ((.cse38 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse2 .cse38)) (not (= .cse38 .cse14)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse39 (select (select |c_#memory_$Pointer$#1.base| .cse38) v_arrayElimCell_127))) (and (not (= .cse2 .cse39)) (= .cse39 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))))) .cse36 (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse40 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse2 .cse40)) (not (= .cse40 .cse14)) (= (select (select |c_#memory_$Pointer$#1.base| .cse40) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) .cse5))) (and .cse0 (or (exists ((v_arrayElimIndex_15 Int)) (let ((.cse41 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse2 .cse41)) (not (= .cse41 .cse14)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse42 (select (select |c_#memory_$Pointer$#1.base| .cse41) v_arrayElimCell_127))) (and (not (= .cse2 .cse42)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= .cse42 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))))) (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse43 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse2 .cse43)) (not (= .cse43 .cse14)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= (select (select |c_#memory_$Pointer$#1.base| .cse43) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) .cse5) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse44 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse44 .cse14)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse45 (select (select |c_#memory_$Pointer$#1.base| .cse44) v_arrayElimCell_127))) (and (not (= .cse2 .cse45)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= .cse45 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) (not (= v_arrayElimIndex_15 0))))) .cse37 (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse46 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse46 .cse14)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= v_arrayElimIndex_15 0)) (= (select (select |c_#memory_$Pointer$#1.base| .cse46) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) .cse5))))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 .cse30) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse31 (= (select (select |c_#memory_int#1| .cse2) 4) 1)) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse14) 1) (= (select |v_old(#valid)_AFTER_CALL_18| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse2) 0) (= (let ((.cse55 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_18|))) (store |v_#valid_BEFORE_CALL_21| .cse55 (select |v_old(#valid)_AFTER_CALL_18| .cse55))) |v_old(#valid)_AFTER_CALL_18|))) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimIndex_11 Int)) (let ((.cse57 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse56 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse56 (select |v_#valid_BEFORE_CALL_19| .cse56)))) (= (select |v_#valid_BEFORE_CALL_18| .cse57) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse57) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_11) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))))))) is different from false [2024-11-18 13:10:34,443 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse14))) (let ((.cse30 (select .cse4 0)) (.cse31 (= .cse2 .cse14))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse54 (select .cse4 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse50 (select |c_#memory_$Pointer$#1.base| .cse54))) (let ((.cse28 (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| 0)) (.cse20 (exists ((v_arrayElimCell_127 Int)) (= (select .cse50 v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) (let ((.cse21 (not (= .cse54 .cse14))) (.cse23 (or (exists ((v_arrayElimCell_127 Int)) (let ((.cse53 (select .cse50 v_arrayElimCell_127))) (and (= .cse53 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= .cse53 .cse2))))) .cse20)) (.cse5 (not .cse28))) (let ((.cse1 (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (and (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= v_arrayElimIndex_15 0)) (= (select (select |c_#memory_$Pointer$#1.base| (select .cse4 v_arrayElimIndex_15)) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))) .cse5)) (.cse7 (exists ((v_arrayElimIndex_15 Int)) (and (exists ((v_arrayElimCell_127 Int)) (let ((.cse52 (select (select |c_#memory_$Pointer$#1.base| (select .cse4 v_arrayElimIndex_15)) v_arrayElimCell_127))) (and (not (= .cse2 .cse52)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= .cse52 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) (not (= v_arrayElimIndex_15 0))))) (.cse22 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse14)) (.cse6 (or (exists ((v_arrayElimCell_127 Int)) (and (= (select .cse50 v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))) (exists ((v_arrayElimCell_127 Int)) (let ((.cse51 (select .cse50 v_arrayElimCell_127))) (and (= .cse51 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= .cse51 .cse2)) (not (= v_arrayElimCell_127 0))))))) (.cse32 (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse49 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse49 .cse14)) (not (= v_arrayElimIndex_15 0)) (= (select (select |c_#memory_$Pointer$#1.base| .cse49) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) .cse5)) (.cse36 (exists ((v_arrayElimIndex_15 Int)) (let ((.cse47 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse47 .cse14)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse48 (select (select |c_#memory_$Pointer$#1.base| .cse47) v_arrayElimCell_127))) (and (not (= .cse2 .cse48)) (= .cse48 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) (not (= v_arrayElimIndex_15 0)))))) (.cse0 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2)) (.cse37 (and .cse21 .cse5 .cse23))) (or (and .cse0 (or .cse1 (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse3 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse2 .cse3)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) .cse5) (and .cse6 .cse5) .cse7 (exists ((v_arrayElimIndex_15 Int)) (let ((.cse8 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse2 .cse8)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| .cse8) v_arrayElimCell_127))) (and (not (= .cse2 .cse9)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= .cse9 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))))))))) (and .cse0 (or (and .cse5 (exists ((v_arrayElimIndex_15 Int)) (let ((.cse10 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse2 .cse10)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse10) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))))) (and (exists ((v_arrayElimIndex_15 Int)) (and (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| (select .cse4 v_arrayElimIndex_15)) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (not (= v_arrayElimIndex_15 0)))) .cse5) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse11 (select .cse4 v_arrayElimIndex_15))) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| .cse11) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (and (not (= .cse2 .cse11)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse12) (not (= .cse2 .cse12)))))))) (and .cse0 (or (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse13 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse13 .cse14)) (= (select (select |c_#memory_$Pointer$#1.base| .cse13) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) .cse5) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse15 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse15 .cse14)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse16 (select (select |c_#memory_$Pointer$#1.base| .cse15) v_arrayElimCell_127))) (and (not (= .cse2 .cse16)) (= .cse16 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))))) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse17 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse17 .cse14)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse18 (select (select |c_#memory_$Pointer$#1.base| .cse17) v_arrayElimCell_127))) (and (not (= .cse2 .cse18)) (= .cse18 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))))))) (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse19 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse19 .cse14)) (= (select (select |c_#memory_$Pointer$#1.base| .cse19) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) .cse5) (and .cse20 .cse21)) .cse22) (and .cse0 (or (and .cse5 .cse23) .cse1 (exists ((v_arrayElimIndex_15 Int)) (let ((.cse24 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse2 .cse24)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse25 (select (select |c_#memory_$Pointer$#1.base| .cse24) v_arrayElimCell_127))) (and (not (= .cse2 .cse25)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= .cse25 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))))) (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse26 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse2 .cse26)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= (select (select |c_#memory_$Pointer$#1.base| .cse26) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) .cse5) .cse7) .cse22) (and (let ((.cse27 (select |c_#memory_$Pointer$#1.base| .cse30))) (or (and .cse22 (or (and .cse5 (exists ((v_arrayElimCell_127 Int)) (and (= (select .cse27 v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) (and (exists ((v_arrayElimCell_127 Int)) (= (select .cse27 v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) .cse28) (exists ((v_arrayElimCell_127 Int)) (let ((.cse29 (select .cse27 v_arrayElimCell_127))) (and (not (= .cse29 .cse2)) (= .cse29 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))))) (and .cse28 (= (select .cse27 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) (not .cse31)) (and .cse0 (or .cse32 (and .cse5 (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse33 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse2 .cse33)) (not (= .cse33 .cse14)) (= (select (select |c_#memory_$Pointer$#1.base| .cse33) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))))) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse34 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse2 .cse34)) (not (= .cse34 .cse14)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse35 (select (select |c_#memory_$Pointer$#1.base| .cse34) v_arrayElimCell_127))) (and (not (= .cse2 .cse35)) (= .cse35 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0)))))))) .cse36 (and .cse21 .cse6 .cse5))) (and .cse0 (or .cse32 .cse37 (exists ((v_arrayElimIndex_15 Int)) (let ((.cse38 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse2 .cse38)) (not (= .cse38 .cse14)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse39 (select (select |c_#memory_$Pointer$#1.base| .cse38) v_arrayElimCell_127))) (and (not (= .cse2 .cse39)) (= .cse39 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))))) .cse36 (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse40 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse2 .cse40)) (not (= .cse40 .cse14)) (= (select (select |c_#memory_$Pointer$#1.base| .cse40) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) .cse5))) (and .cse0 (or (exists ((v_arrayElimIndex_15 Int)) (let ((.cse41 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse2 .cse41)) (not (= .cse41 .cse14)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse42 (select (select |c_#memory_$Pointer$#1.base| .cse41) v_arrayElimCell_127))) (and (not (= .cse2 .cse42)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= .cse42 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))))) (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse43 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse2 .cse43)) (not (= .cse43 .cse14)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= (select (select |c_#memory_$Pointer$#1.base| .cse43) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) .cse5) (exists ((v_arrayElimIndex_15 Int)) (let ((.cse44 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse44 .cse14)) (exists ((v_arrayElimCell_127 Int)) (let ((.cse45 (select (select |c_#memory_$Pointer$#1.base| .cse44) v_arrayElimCell_127))) (and (not (= .cse2 .cse45)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (= .cse45 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) (not (= v_arrayElimIndex_15 0))))) .cse37 (and (exists ((v_arrayElimIndex_15 Int) (v_arrayElimCell_127 Int)) (let ((.cse46 (select .cse4 v_arrayElimIndex_15))) (and (not (= .cse46 .cse14)) (not (= v_arrayElimCell_127 v_arrayElimIndex_15)) (not (= v_arrayElimIndex_15 0)) (= (select (select |c_#memory_$Pointer$#1.base| .cse46) v_arrayElimCell_127) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= v_arrayElimCell_127 0))))) .cse5))))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 .cse30) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse31 (= (select (select |c_#memory_int#1| .cse2) 4) 1)) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse14) 1) (= (select |v_old(#valid)_AFTER_CALL_18| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse2) 0) (= (let ((.cse55 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_18|))) (store |v_#valid_BEFORE_CALL_21| .cse55 (select |v_old(#valid)_AFTER_CALL_18| .cse55))) |v_old(#valid)_AFTER_CALL_18|))) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int)) (v_arrayElimIndex_11 Int)) (let ((.cse57 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse56 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse56 (select |v_#valid_BEFORE_CALL_19| .cse56)))) (= (select |v_#valid_BEFORE_CALL_18| .cse57) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse57) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_11) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))))))) is different from true