./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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_prepend_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 f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 06:37:30,484 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 06:37:30,553 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 06:37:30,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 06:37:30,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 06:37:30,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 06:37:30,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 06:37:30,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 06:37:30,586 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 06:37:30,586 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 06:37:30,586 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 06:37:30,587 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 06:37:30,587 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 06:37:30,588 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 06:37:30,588 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 06:37:30,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 06:37:30,589 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 06:37:30,589 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 06:37:30,589 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 06:37:30,590 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 06:37:30,590 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 06:37:30,591 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 06:37:30,591 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 06:37:30,591 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 06:37:30,592 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 06:37:30,592 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 06:37:30,592 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 06:37:30,592 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 06:37:30,593 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 06:37:30,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 06:37:30,593 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 06:37:30,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 06:37:30,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:37:30,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 06:37:30,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 06:37:30,595 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 06:37:30,595 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 06:37:30,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 06:37:30,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 06:37:30,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 06:37:30,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 06:37:30,597 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 06:37:30,597 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 -> f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 [2024-11-16 06:37:30,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 06:37:30,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 06:37:30,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 06:37:30,927 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 06:37:30,927 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 06:37:30,928 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2024-11-16 06:37:32,358 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 06:37:32,579 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 06:37:32,582 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2024-11-16 06:37:32,595 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/125575be0/6077e4b95a5e4e34bbd05c5d8767037b/FLAGd76e1c712 [2024-11-16 06:37:32,608 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/125575be0/6077e4b95a5e4e34bbd05c5d8767037b [2024-11-16 06:37:32,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 06:37:32,612 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 06:37:32,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 06:37:32,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 06:37:32,617 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 06:37:32,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:37:32" (1/1) ... [2024-11-16 06:37:32,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@554b021a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:32, skipping insertion in model container [2024-11-16 06:37:32,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:37:32" (1/1) ... [2024-11-16 06:37:32,659 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 06:37:32,996 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_prepend_unequal.i[24547,24560] [2024-11-16 06:37:33,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:37:33,012 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 06:37:33,059 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_prepend_unequal.i[24547,24560] [2024-11-16 06:37:33,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:37:33,093 INFO L204 MainTranslator]: Completed translation [2024-11-16 06:37:33,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:33 WrapperNode [2024-11-16 06:37:33,093 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 06:37:33,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 06:37:33,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 06:37:33,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 06:37:33,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:33" (1/1) ... [2024-11-16 06:37:33,114 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:33" (1/1) ... [2024-11-16 06:37:33,141 INFO L138 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 145 [2024-11-16 06:37:33,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 06:37:33,142 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 06:37:33,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 06:37:33,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 06:37:33,153 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:33" (1/1) ... [2024-11-16 06:37:33,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:33" (1/1) ... [2024-11-16 06:37:33,159 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:33" (1/1) ... [2024-11-16 06:37:33,190 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 15, 10]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 9 writes are split as follows [0, 7, 2]. [2024-11-16 06:37:33,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:33" (1/1) ... [2024-11-16 06:37:33,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:33" (1/1) ... [2024-11-16 06:37:33,199 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:33" (1/1) ... [2024-11-16 06:37:33,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:33" (1/1) ... [2024-11-16 06:37:33,202 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:33" (1/1) ... [2024-11-16 06:37:33,203 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:33" (1/1) ... [2024-11-16 06:37:33,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 06:37:33,207 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 06:37:33,207 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 06:37:33,207 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 06:37:33,208 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:33" (1/1) ... [2024-11-16 06:37:33,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:37:33,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:37:33,251 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-16 06:37:33,257 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-16 06:37:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 06:37:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 06:37:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-16 06:37:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 06:37:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 06:37:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-16 06:37:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-16 06:37:33,351 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-16 06:37:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 06:37:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 06:37:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 06:37:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-16 06:37:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-16 06:37:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-16 06:37:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-16 06:37:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-16 06:37:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-16 06:37:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 06:37:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-16 06:37:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-16 06:37:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-16 06:37:33,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 06:37:33,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 06:37:33,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 06:37:33,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 06:37:33,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 06:37:33,534 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 06:37:33,535 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 06:37:33,699 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L624: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2024-11-16 06:37:33,730 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: assume true;havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2024-11-16 06:37:33,756 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-11-16 06:37:33,757 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 06:37:33,772 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 06:37:33,772 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 06:37:33,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:37:33 BoogieIcfgContainer [2024-11-16 06:37:33,773 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 06:37:33,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 06:37:33,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 06:37:33,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 06:37:33,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:37:32" (1/3) ... [2024-11-16 06:37:33,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d6966b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:37:33, skipping insertion in model container [2024-11-16 06:37:33,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:33" (2/3) ... [2024-11-16 06:37:33,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d6966b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:37:33, skipping insertion in model container [2024-11-16 06:37:33,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:37:33" (3/3) ... [2024-11-16 06:37:33,784 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2024-11-16 06:37:33,796 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 06:37:33,797 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 06:37:33,842 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 06:37:33,847 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;@6baf2f18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 06:37:33,847 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 06:37:33,851 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 06:37:33,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-16 06:37:33,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:37:33,859 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] [2024-11-16 06:37:33,859 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:37:33,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:37:33,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1695540442, now seen corresponding path program 1 times [2024-11-16 06:37:33,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:37:33,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389511444] [2024-11-16 06:37:33,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:37:33,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:37:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:34,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 06:37:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:34,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 06:37:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:34,209 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-16 06:37:34,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:37:34,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389511444] [2024-11-16 06:37:34,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389511444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:37:34,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:37:34,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 06:37:34,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675542647] [2024-11-16 06:37:34,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:37:34,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 06:37:34,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:37:34,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 06:37:34,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:37:34,236 INFO L87 Difference]: Start difference. First operand has 40 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 06:37:34,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:37:34,311 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2024-11-16 06:37:34,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 06:37:34,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2024-11-16 06:37:34,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:37:34,324 INFO L225 Difference]: With dead ends: 71 [2024-11-16 06:37:34,324 INFO L226 Difference]: Without dead ends: 30 [2024-11-16 06:37:34,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-16 06:37:34,331 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:37:34,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:37:34,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-16 06:37:34,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-16 06:37:34,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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-16 06:37:34,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-16 06:37:34,367 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 24 [2024-11-16 06:37:34,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:37:34,368 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-16 06:37:34,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 06:37:34,368 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-16 06:37:34,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-16 06:37:34,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:37:34,370 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-16 06:37:34,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 06:37:34,370 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:37:34,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:37:34,371 INFO L85 PathProgramCache]: Analyzing trace with hash -108411959, now seen corresponding path program 1 times [2024-11-16 06:37:34,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:37:34,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422021259] [2024-11-16 06:37:34,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:37:34,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:37:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:34,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 06:37:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:34,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 06:37:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:34,660 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-16 06:37:34,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:37:34,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422021259] [2024-11-16 06:37:34,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422021259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:37:34,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:37:34,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 06:37:34,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733439252] [2024-11-16 06:37:34,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:37:34,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 06:37:34,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:37:34,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 06:37:34,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:37:34,668 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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-16 06:37:34,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:37:34,732 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2024-11-16 06:37:34,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 06:37:34,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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-16 06:37:34,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:37:34,734 INFO L225 Difference]: With dead ends: 56 [2024-11-16 06:37:34,735 INFO L226 Difference]: Without dead ends: 34 [2024-11-16 06:37:34,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:37:34,737 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:37:34,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 82 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:37:34,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-16 06:37:34,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-11-16 06:37:34,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 06:37:34,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-11-16 06:37:34,748 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 25 [2024-11-16 06:37:34,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:37:34,749 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-11-16 06:37:34,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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-16 06:37:34,750 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-11-16 06:37:34,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-16 06:37:34,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:37:34,752 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] [2024-11-16 06:37:34,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 06:37:34,753 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:37:34,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:37:34,754 INFO L85 PathProgramCache]: Analyzing trace with hash 353163781, now seen corresponding path program 1 times [2024-11-16 06:37:34,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:37:34,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179285577] [2024-11-16 06:37:34,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:37:34,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:37:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:35,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 06:37:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:35,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 06:37:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:35,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 06:37:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:35,333 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 06:37:35,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:37:35,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179285577] [2024-11-16 06:37:35,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179285577] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:37:35,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729159181] [2024-11-16 06:37:35,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:37:35,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:37:35,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:37:35,338 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-16 06:37:35,340 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-16 06:37:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:35,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-16 06:37:35,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:37:35,710 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-16 06:37:35,731 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 06:37:35,732 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:37:35,813 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 06:37:35,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729159181] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:37:35,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:37:35,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 13 [2024-11-16 06:37:35,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798058417] [2024-11-16 06:37:35,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:37:35,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 06:37:35,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:37:35,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 06:37:35,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-16 06:37:35,817 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-16 06:37:39,846 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-16 06:37:43,876 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-16 06:37:47,900 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-16 06:37:51,917 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-16 06:37:56,087 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-16 06:38:00,135 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-16 06:38:00,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:38:00,140 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2024-11-16 06:38:00,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 06:38:00,140 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 34 [2024-11-16 06:38:00,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:38:00,141 INFO L225 Difference]: With dead ends: 48 [2024-11-16 06:38:00,142 INFO L226 Difference]: Without dead ends: 39 [2024-11-16 06:38:00,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-16 06:38:00,143 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2024-11-16 06:38:00,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 316 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 6 Unknown, 0 Unchecked, 24.2s Time] [2024-11-16 06:38:00,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-16 06:38:00,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-11-16 06:38:00,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 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-16 06:38:00,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-11-16 06:38:00,151 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 34 [2024-11-16 06:38:00,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:38:00,151 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-11-16 06:38:00,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-16 06:38:00,152 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-11-16 06:38:00,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-16 06:38:00,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:38:00,153 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] [2024-11-16 06:38:00,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 06:38:00,357 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-16 06:38:00,358 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:38:00,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:38:00,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1639330261, now seen corresponding path program 1 times [2024-11-16 06:38:00,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:38:00,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581297312] [2024-11-16 06:38:00,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:38:00,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:38:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:01,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 06:38:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:01,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 06:38:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:01,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 06:38:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:01,596 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 06:38:01,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:38:01,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581297312] [2024-11-16 06:38:01,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581297312] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:38:01,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072259307] [2024-11-16 06:38:01,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:38:01,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:38:01,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:38:01,599 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-16 06:38:01,600 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-16 06:38:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:01,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-16 06:38:01,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:38:01,797 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-16 06:38:01,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-16 06:38:01,985 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-16 06:38:02,054 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-16 06:38:02,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-16 06:38:02,248 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 15 treesize of output 1 [2024-11-16 06:38:02,257 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 81 treesize of output 40 [2024-11-16 06:38:02,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2024-11-16 06:38:02,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 21 [2024-11-16 06:38:02,310 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 35 treesize of output 27 [2024-11-16 06:38:02,315 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 27 treesize of output 19 [2024-11-16 06:38:02,317 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 7 [2024-11-16 06:38:02,345 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 06:38:02,345 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:38:02,360 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 76 treesize of output 72 [2024-11-16 06:38:02,467 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse4 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (forall ((v_ArrVal_473 (Array Int Int)) (v_ArrVal_476 (Array Int Int)) (v_arrayElimCell_11 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_473) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_476) .cse6) (+ 4 v_arrayElimCell_11))) (not (= v_ArrVal_473 (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_473 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))))) (and (or .cse0 .cse1) (or (forall ((v_ArrVal_473 (Array Int Int)) (v_ArrVal_476 (Array Int Int))) (or (not (= v_ArrVal_473 (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_473 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_473) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_476) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse3)))) (not .cse0) (not .cse4)) (forall ((v_ArrVal_473 (Array Int Int))) (or (forall ((v_ArrVal_476 (Array Int Int)) (v_arrayElimCell_11 Int)) (let ((.cse5 (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_473) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_476))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse5 .cse6) (+ 4 v_arrayElimCell_11))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse5 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3))))) (not (= v_ArrVal_473 (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_473 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) (or .cse4 .cse1)))) is different from false [2024-11-16 06:38:02,653 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse4 (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (let ((.cse2 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse6 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (forall ((v_ArrVal_473 (Array Int Int)) (v_ArrVal_476 (Array Int Int)) (v_arrayElimCell_11 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_473) .cse4 v_ArrVal_476) .cse3) (+ 4 v_arrayElimCell_11))) (not (= v_ArrVal_473 (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_473 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))))) (.cse7 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (forall ((v_ArrVal_473 (Array Int Int))) (or (forall ((v_ArrVal_476 (Array Int Int)) (v_arrayElimCell_11 Int)) (let ((.cse0 (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_473) .cse4 v_ArrVal_476))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse0 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse0 .cse3) (+ 4 v_arrayElimCell_11)))))) (not (= v_ArrVal_473 (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_473 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) (or (not .cse6) (not .cse7) (forall ((v_ArrVal_473 (Array Int Int)) (v_ArrVal_476 (Array Int Int))) (or (not (= v_ArrVal_473 (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_473 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_473) .cse4 v_ArrVal_476) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse2) |c_ULTIMATE.start_main_~uneq~0#1|)))) (or .cse6 .cse8) (or .cse8 .cse7))))) is different from false [2024-11-16 06:38:02,726 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse5 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) (.cse3 (select .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (forall ((v_ArrVal_473 (Array Int Int)) (v_ArrVal_476 (Array Int Int)) (v_arrayElimCell_11 Int)) (or (not (= v_ArrVal_473 (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| (select v_ArrVal_473 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_473) .cse3 v_ArrVal_476) .cse7) (+ 4 v_arrayElimCell_11)))))) (.cse2 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (and (or .cse0 .cse1) (or (not .cse2) (not .cse1) (forall ((v_ArrVal_473 (Array Int Int)) (v_ArrVal_476 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_473) .cse3 v_ArrVal_476) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse4) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_473 (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| (select v_ArrVal_473 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|))))))) (or .cse0 .cse2) (forall ((v_ArrVal_473 (Array Int Int))) (or (not (= v_ArrVal_473 (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| (select v_ArrVal_473 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)))) (forall ((v_ArrVal_476 (Array Int Int)) (v_arrayElimCell_11 Int)) (let ((.cse6 (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_473) .cse3 v_ArrVal_476))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse6 .cse7) (+ 4 v_arrayElimCell_11))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse6 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4))))))))))) is different from false [2024-11-16 06:38:02,826 INFO L349 Elim1Store]: treesize reduction 12, result has 78.9 percent of original size [2024-11-16 06:38:02,827 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 582 treesize of output 587 [2024-11-16 06:38:02,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:38:02,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 542 treesize of output 535 [2024-11-16 06:38:02,866 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 526 treesize of output 522 [2024-11-16 06:38:02,882 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 522 treesize of output 514 [2024-11-16 06:38:02,899 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 514 treesize of output 506 [2024-11-16 06:38:03,308 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 114 treesize of output 106 [2024-11-16 06:38:03,355 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:38:03,356 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:38:03,362 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-16 06:38:03,414 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 54 treesize of output 50 [2024-11-16 06:38:03,595 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 121 treesize of output 109 [2024-11-16 06:38:03,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:38:03,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 41 [2024-11-16 06:38:03,669 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 114 treesize of output 106 [2024-11-16 06:38:03,680 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 54 treesize of output 50 [2024-11-16 06:38:03,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072259307] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:38:03,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 06:38:03,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 30 [2024-11-16 06:38:03,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823091864] [2024-11-16 06:38:03,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 06:38:03,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-16 06:38:03,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:38:03,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-16 06:38:03,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=862, Unknown=3, NotChecked=180, Total=1122 [2024-11-16 06:38:03,808 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 30 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 24 states have internal predecessors, (55), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-16 06:38:04,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:38:04,532 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2024-11-16 06:38:04,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-16 06:38:04,533 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 24 states have internal predecessors, (55), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2024-11-16 06:38:04,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:38:04,535 INFO L225 Difference]: With dead ends: 67 [2024-11-16 06:38:04,535 INFO L226 Difference]: Without dead ends: 57 [2024-11-16 06:38:04,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=124, Invalid=1367, Unknown=3, NotChecked=228, Total=1722 [2024-11-16 06:38:04,537 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 06:38:04,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 467 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 06:38:04,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-16 06:38:04,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2024-11-16 06:38:04,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 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-16 06:38:04,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2024-11-16 06:38:04,545 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 37 [2024-11-16 06:38:04,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:38:04,545 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2024-11-16 06:38:04,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 24 states have internal predecessors, (55), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-16 06:38:04,546 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2024-11-16 06:38:04,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-16 06:38:04,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:38:04,547 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] [2024-11-16 06:38:04,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 06:38:04,747 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-16 06:38:04,747 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:38:04,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:38:04,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1403326538, now seen corresponding path program 1 times [2024-11-16 06:38:04,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:38:04,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303309925] [2024-11-16 06:38:04,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:38:04,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:38:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:05,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 06:38:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:06,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 06:38:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:06,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 06:38:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 06:38:06,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:38:06,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303309925] [2024-11-16 06:38:06,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303309925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:38:06,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379092957] [2024-11-16 06:38:06,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:38:06,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:38:06,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:38:06,395 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-16 06:38:06,396 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-16 06:38:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:06,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-11-16 06:38:06,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:38:06,548 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-16 06:38:06,823 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-16 06:38:06,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-16 06:38:06,912 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-16 06:38:06,999 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-16 06:38:06,999 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 34 treesize of output 33 [2024-11-16 06:38:07,132 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-16 06:38:07,136 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-16 06:38:07,253 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-16 06:38:07,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:38:07,334 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-16 06:38:07,352 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-16 06:38:07,352 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-16 06:38:07,684 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:38:07,685 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:38:07,685 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 44 treesize of output 16 [2024-11-16 06:38:07,804 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 46 treesize of output 44 [2024-11-16 06:38:07,811 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 26 treesize of output 21 [2024-11-16 06:38:07,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2024-11-16 06:38:07,837 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-16 06:38:07,837 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 2 case distinctions, treesize of input 30 treesize of output 22 [2024-11-16 06:38:07,877 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 35 treesize of output 27 [2024-11-16 06:38:07,880 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 27 treesize of output 19 [2024-11-16 06:38:07,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-16 06:38:07,885 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:38:07,885 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:38:08,015 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_661 Int) (v_ArrVal_659 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_661)) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_659) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2024-11-16 06:38:08,032 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_661 Int) (v_ArrVal_659 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_661)) (select (select |c_#memory_$Pointer$#1.base| (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_659) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2024-11-16 06:38:08,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:38:08,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 70 [2024-11-16 06:38:08,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:38:08,253 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 126 treesize of output 125 [2024-11-16 06:38:08,263 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 50 treesize of output 34 [2024-11-16 06:38:08,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379092957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:38:08,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 06:38:08,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 42 [2024-11-16 06:38:08,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129847542] [2024-11-16 06:38:08,474 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 06:38:08,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-16 06:38:08,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:38:08,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-16 06:38:08,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1835, Unknown=40, NotChecked=174, Total=2162 [2024-11-16 06:38:08,480 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 42 states, 40 states have (on average 1.525) internal successors, (61), 33 states have internal predecessors, (61), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-16 06:38:10,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:38:10,506 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2024-11-16 06:38:10,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-16 06:38:10,507 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.525) internal successors, (61), 33 states have internal predecessors, (61), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 39 [2024-11-16 06:38:10,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:38:10,508 INFO L225 Difference]: With dead ends: 89 [2024-11-16 06:38:10,509 INFO L226 Difference]: Without dead ends: 86 [2024-11-16 06:38:10,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=281, Invalid=4108, Unknown=41, NotChecked=262, Total=4692 [2024-11-16 06:38:10,511 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 67 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 06:38:10,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 652 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 06:38:10,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-16 06:38:10,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 69. [2024-11-16 06:38:10,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 58 states have internal predecessors, (67), 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-16 06:38:10,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2024-11-16 06:38:10,534 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 39 [2024-11-16 06:38:10,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:38:10,535 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2024-11-16 06:38:10,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.525) internal successors, (61), 33 states have internal predecessors, (61), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-16 06:38:10,535 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2024-11-16 06:38:10,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-16 06:38:10,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:38:10,540 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-16 06:38:10,559 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-16 06:38:10,741 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-16 06:38:10,742 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:38:10,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:38:10,742 INFO L85 PathProgramCache]: Analyzing trace with hash 25511285, now seen corresponding path program 1 times [2024-11-16 06:38:10,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:38:10,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441417100] [2024-11-16 06:38:10,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:38:10,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:38:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:12,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 06:38:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:12,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 06:38:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:12,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 06:38:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:13,084 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 06:38:13,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:38:13,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441417100] [2024-11-16 06:38:13,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441417100] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:38:13,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722248339] [2024-11-16 06:38:13,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:38:13,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:38:13,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:38:13,087 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-16 06:38:13,088 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-16 06:38:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:13,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 124 conjuncts are in the unsatisfiable core [2024-11-16 06:38:13,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:38:13,312 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-16 06:38:13,590 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-16 06:38:13,676 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-16 06:38:13,676 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-16 06:38:13,730 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-16 06:38:13,740 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-16 06:38:13,827 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-16 06:38:13,827 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-16 06:38:13,835 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-16 06:38:13,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 30 treesize of output 14 [2024-11-16 06:38:13,985 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-16 06:38:13,990 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-16 06:38:14,249 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-16 06:38:14,250 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-16 06:38:14,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:38:14,273 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-16 06:38:14,301 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-16 06:38:14,301 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-16 06:38:14,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2024-11-16 06:38:14,775 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 49 treesize of output 15 [2024-11-16 06:38:14,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 63 [2024-11-16 06:38:14,803 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-16 06:38:14,804 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 100 treesize of output 78 [2024-11-16 06:38:14,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 67 [2024-11-16 06:38:14,816 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 56 treesize of output 19 [2024-11-16 06:38:14,840 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-16 06:38:14,840 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 2 case distinctions, treesize of input 30 treesize of output 22 [2024-11-16 06:38:14,909 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 118 treesize of output 82 [2024-11-16 06:38:14,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 58 [2024-11-16 06:38:14,992 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-16 06:38:14,992 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 55 treesize of output 26 [2024-11-16 06:38:14,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-16 06:38:15,085 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:38:15,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:38:15,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:38:15,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 102 [2024-11-16 06:38:15,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:38:15,249 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 204 treesize of output 207 [2024-11-16 06:38:15,257 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 88 treesize of output 74 [2024-11-16 06:38:15,470 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse7)) (.cse5 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse4 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse13 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse4)) (.cse1 (+ (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 4)) (.cse11 (not .cse9)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse3 (select .cse13 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_78 Int)) (let ((.cse0 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_858) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_853) .cse4) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 (+ 4 v_arrayElimCell_78))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse1))))) (or (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_78 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_858) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_853) .cse4) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_78)))) (not .cse6)) (or (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_77 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_858) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_853) .cse7) .cse8)) (+ 4 v_arrayElimCell_77))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse9) (or .cse6 (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_858) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_853) .cse4) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse1)))) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (or (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_arrayElimCell_78 Int) (v_arrayElimCell_77 Int)) (let ((.cse10 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_858) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_853) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 (+ 4 v_arrayElimCell_77))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 (+ 4 v_arrayElimCell_78)))))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (or .cse11 (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_78 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_858) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_853) .cse7) .cse8)) (+ 4 v_arrayElimCell_78))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (or (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse4) (and (or .cse11 (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_78 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_858) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_853) .cse7) .cse8)) (+ 4 v_arrayElimCell_78))))) (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_78 Int) (v_arrayElimCell_77 Int)) (let ((.cse12 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_858) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_853) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 (+ 4 v_arrayElimCell_77))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 (+ 4 v_arrayElimCell_78)))))) (or .cse9 (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_77 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_858) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_853) .cse7) .cse8)) (+ 4 v_arrayElimCell_77))))))))))) is different from false [2024-11-16 06:38:15,793 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse14 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse9 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse14 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (= .cse3 .cse0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse12 (not .cse6)) (.cse13 (= .cse9 .cse0)) (.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse2 (select .cse14 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse8 (+ (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 4))) (and (or (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_77 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_858) .cse0 v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse0 v_ArrVal_853) .cse3) .cse4)) (+ 4 v_arrayElimCell_77))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse6) (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_78 Int)) (let ((.cse7 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_858) .cse0 v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse0 v_ArrVal_853) .cse9) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 (+ 4 v_arrayElimCell_78)))))) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (or (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_arrayElimCell_78 Int) (v_arrayElimCell_77 Int)) (let ((.cse10 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_858) .cse0 v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse0 v_ArrVal_853) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 (+ 4 v_arrayElimCell_77))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 (+ 4 v_arrayElimCell_78)))))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse9) (and (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_78 Int) (v_arrayElimCell_77 Int)) (let ((.cse11 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_858) .cse0 v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse0 v_ArrVal_853) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (+ 4 v_arrayElimCell_77))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (+ 4 v_arrayElimCell_78)))))) (or .cse12 (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_78 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_858) .cse0 v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse0 v_ArrVal_853) .cse3) .cse4)) (+ 4 v_arrayElimCell_78))))) (or .cse6 (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_77 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_858) .cse0 v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse0 v_ArrVal_853) .cse3) .cse4)) (+ 4 v_arrayElimCell_77))))))) (or (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_78 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_858) .cse0 v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse0 v_ArrVal_853) .cse3) .cse4)) (+ 4 v_arrayElimCell_78))))) .cse12) (or (not .cse13) (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_78 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_858) .cse0 v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse0 v_ArrVal_853) .cse9) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_78))))) (or .cse13 (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_858) .cse0 v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse0 v_ArrVal_853) .cse9) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse8)))))))) is different from false [2024-11-16 06:38:16,043 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse15 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse2 (select .cse15 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse14 (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse14)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (= .cse0 .cse3))) (let ((.cse6 (not .cse13)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse10 (+ .cse14 4)) (.cse8 (= .cse0 .cse7))) (and (or (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_78 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_858) .cse0 v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse0 v_ArrVal_853) .cse3) .cse4)) (+ 4 v_arrayElimCell_78))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse6) (or (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_78 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_858) .cse0 v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse0 v_ArrVal_853) .cse7) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_78)))) (not .cse8)) (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_78 Int)) (let ((.cse9 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_858) .cse0 v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse0 v_ArrVal_853) .cse7) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 (+ 4 v_arrayElimCell_78))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 .cse10))))) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (or (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_arrayElimCell_78 Int) (v_arrayElimCell_77 Int)) (let ((.cse11 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_858) .cse0 v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse0 v_ArrVal_853) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (+ 4 v_arrayElimCell_78))) (= (select .cse11 (+ 4 v_arrayElimCell_77)) |c_ULTIMATE.start_main_~data~0#1|)))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (or (and (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_78 Int) (v_arrayElimCell_77 Int)) (let ((.cse12 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_858) .cse0 v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse0 v_ArrVal_853) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 (+ 4 v_arrayElimCell_78))) (= (select .cse12 (+ 4 v_arrayElimCell_77)) |c_ULTIMATE.start_main_~data~0#1|)))) (or .cse6 (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_78 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_858) .cse0 v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse0 v_ArrVal_853) .cse3) .cse4)) (+ 4 v_arrayElimCell_78))))) (or (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_77 Int)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_858) .cse0 v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse0 v_ArrVal_853) .cse3) .cse4)) (+ 4 v_arrayElimCell_77)) |c_ULTIMATE.start_main_~data~0#1|)) .cse13)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse7)) (or (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_77 Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_858) .cse0 v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse0 v_ArrVal_853) .cse3) .cse4)) (+ 4 v_arrayElimCell_77)) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse13) (or (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_858) .cse0 v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse0 v_ArrVal_853) .cse7) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse10))) .cse8))))))) is different from false [2024-11-16 06:38:16,184 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse15 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse2 (select .cse15 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse14 (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse14)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (= .cse0 .cse7)) (.cse3 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (+ .cse14 4)) (.cse6 (= .cse0 .cse3)) (.cse10 (not .cse9)) (.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (or (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_858) .cse0 v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse0 v_ArrVal_853) .cse3) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse5) |c_ULTIMATE.start_main_~data~0#1|)) .cse6) (or (and (or (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_77 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_858) .cse0 v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse0 v_ArrVal_853) .cse7) .cse8)) (+ 4 v_arrayElimCell_77)))) .cse9) (or .cse10 (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_78 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_858) .cse0 v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse0 v_ArrVal_853) .cse7) .cse8)) (+ 4 v_arrayElimCell_78))))) (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_78 Int) (v_arrayElimCell_77 Int)) (let ((.cse11 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_858) .cse0 v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse0 v_ArrVal_853) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (+ 4 v_arrayElimCell_77))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (+ 4 v_arrayElimCell_78))))))) (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse3)) (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_78 Int)) (let ((.cse12 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_858) .cse0 v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse0 v_ArrVal_853) .cse3) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse12 .cse5) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 (+ 4 v_arrayElimCell_78)))))) (or (not .cse6) (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_78 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_858) .cse0 v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse0 v_ArrVal_853) .cse3) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_78))))) (or .cse10 (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_78 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_858) .cse0 v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse0 v_ArrVal_853) .cse7) .cse8)) (+ 4 v_arrayElimCell_78))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (or (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_77 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_858) .cse0 v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse0 v_ArrVal_853) .cse7) .cse8)) (+ 4 v_arrayElimCell_77))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse9) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (or (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_arrayElimCell_78 Int) (v_arrayElimCell_77 Int)) (let ((.cse13 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_858) .cse0 v_ArrVal_857) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse0 v_ArrVal_853) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 (+ 4 v_arrayElimCell_77))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 (+ 4 v_arrayElimCell_78)))))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))))))) is different from false [2024-11-16 06:38:20,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722248339] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:38:20,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 06:38:20,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 49 [2024-11-16 06:38:20,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906374384] [2024-11-16 06:38:20,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 06:38:20,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-16 06:38:20,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:38:20,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-16 06:38:20,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2620, Unknown=4, NotChecked=420, Total=3192 [2024-11-16 06:38:20,069 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 49 states, 45 states have (on average 1.488888888888889) internal successors, (67), 40 states have internal predecessors, (67), 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-16 06:38:23,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:38:23,137 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2024-11-16 06:38:23,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-16 06:38:23,138 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 45 states have (on average 1.488888888888889) internal successors, (67), 40 states have internal predecessors, (67), 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 41 [2024-11-16 06:38:23,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:38:23,139 INFO L225 Difference]: With dead ends: 89 [2024-11-16 06:38:23,140 INFO L226 Difference]: Without dead ends: 86 [2024-11-16 06:38:23,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=290, Invalid=4692, Unknown=4, NotChecked=564, Total=5550 [2024-11-16 06:38:23,143 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 70 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 06:38:23,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 638 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 06:38:23,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-16 06:38:23,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2024-11-16 06:38:23,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 65 states have internal predecessors, (75), 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-16 06:38:23,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2024-11-16 06:38:23,155 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 41 [2024-11-16 06:38:23,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:38:23,155 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2024-11-16 06:38:23,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 45 states have (on average 1.488888888888889) internal successors, (67), 40 states have internal predecessors, (67), 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-16 06:38:23,156 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2024-11-16 06:38:23,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-16 06:38:23,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:38:23,157 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] [2024-11-16 06:38:23,171 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-16 06:38:23,360 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-16 06:38:23,361 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:38:23,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:38:23,361 INFO L85 PathProgramCache]: Analyzing trace with hash -523781801, now seen corresponding path program 2 times [2024-11-16 06:38:23,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:38:23,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591502576] [2024-11-16 06:38:23,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:38:23,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:38:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:24,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 06:38:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:24,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 06:38:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:24,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 06:38:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:24,856 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 06:38:24,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:38:24,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591502576] [2024-11-16 06:38:24,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591502576] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:38:24,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178801650] [2024-11-16 06:38:24,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 06:38:24,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:38:24,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:38:24,859 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-16 06:38:24,861 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-16 06:38:25,032 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 06:38:25,032 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 06:38:25,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 133 conjuncts are in the unsatisfiable core [2024-11-16 06:38:25,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:38:25,044 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-16 06:38:25,182 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 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|)) is different from false [2024-11-16 06:38:25,185 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 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|)) is different from true [2024-11-16 06:38:25,194 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-16 06:38:25,201 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-16 06:38:25,218 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_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) is different from false [2024-11-16 06:38:25,220 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_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) is different from true [2024-11-16 06:38:25,280 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-16 06:38:25,281 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 45 treesize of output 31 [2024-11-16 06:38:25,304 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-16 06:38:25,305 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-16 06:38:25,313 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0) (= 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.offset| 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)))) is different from false [2024-11-16 06:38:25,316 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0) (= 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.offset| 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)))) is different from true [2024-11-16 06:38:25,354 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (and (or (= .cse0 .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1)))) is different from false [2024-11-16 06:38:25,357 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (and (or (= .cse0 .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1)))) is different from true [2024-11-16 06:38:25,374 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-16 06:38:25,374 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 60 treesize of output 35 [2024-11-16 06:38:25,381 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-16 06:38:25,408 WARN L851 $PredicateComparison]: unable to prove that (and (= |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_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_6) 1))))) is different from false [2024-11-16 06:38:25,410 WARN L873 $PredicateComparison]: unable to prove that (and (= |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_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_6) 1))))) is different from true [2024-11-16 06:38:25,440 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= (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_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_6) 1))))) is different from false [2024-11-16 06:38:25,443 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= (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_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_6) 1))))) is different from true [2024-11-16 06:38:25,498 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-16 06:38:25,505 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) (+ |c_node_create_#res#1.offset| 4)) |c_node_create_#in~data#1|) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_6) 1)))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from false [2024-11-16 06:38:25,508 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) (+ |c_node_create_#res#1.offset| 4)) |c_node_create_#in~data#1|) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_6) 1)))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from true [2024-11-16 06:38:25,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:38:25,569 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-16 06:38:25,570 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 68 treesize of output 57 [2024-11-16 06:38:25,605 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-16 06:38:25,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2024-11-16 06:38:25,655 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse2 .cse3) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse3)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 0) .cse3)))) is different from false [2024-11-16 06:38:25,658 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse2 .cse3) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse3)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 0) .cse3)))) is different from true [2024-11-16 06:38:25,745 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1)))) (or (= .cse2 .cse3) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse3)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 0) .cse3)))) is different from false [2024-11-16 06:38:25,750 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1)))) (or (= .cse2 .cse3) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse3)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 0) .cse3)))) is different from true [2024-11-16 06:38:25,867 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1)))) (or (= .cse2 .cse3) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse3)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 0) .cse3)))) is different from false [2024-11-16 06:38:25,871 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1)))) (or (= .cse2 .cse3) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse3)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 0) .cse3)))) is different from true [2024-11-16 06:38:25,971 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:38:25,972 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:38:25,972 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2024-11-16 06:38:26,038 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (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|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_old(#valid)_AFTER_CALL_15| .cse3))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 1))) (or (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= .cse4 .cse2) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse2)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select (select |c_#memory_$Pointer$#1.base| .cse4) 0) .cse2)))) is different from false [2024-11-16 06:38:26,041 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (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|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_old(#valid)_AFTER_CALL_15| .cse3))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 1))) (or (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= .cse4 .cse2) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse2)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select (select |c_#memory_$Pointer$#1.base| .cse4) 0) .cse2)))) is different from true [2024-11-16 06:38:26,139 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:38:26,140 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:38:26,150 INFO L349 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2024-11-16 06:38:26,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 78 treesize of output 43 [2024-11-16 06:38:26,182 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|))) is different from false [2024-11-16 06:38:26,184 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|))) is different from true [2024-11-16 06:38:26,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2024-11-16 06:38:26,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:38:26,297 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 34 treesize of output 21 [2024-11-16 06:38:26,337 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-11-16 06:38:26,337 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 2 case distinctions, treesize of input 52 treesize of output 48 [2024-11-16 06:38:26,362 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-16 06:38:26,362 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 2 case distinctions, treesize of input 30 treesize of output 22 [2024-11-16 06:38:29,066 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse6 (exists ((v_arrayElimCell_93 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse11 (select |v_old(#valid)_AFTER_CALL_15| .cse11))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| v_arrayElimCell_93) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimCell_93) 0))))) (or (exists ((v_arrayElimCell_94 Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_94) 1) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimCell_94) 0) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1)))) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimCell_94) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| v_arrayElimCell_94) 1))) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse3) 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_#valid_BEFORE_CALL_12| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4))) |v_old(#valid)_AFTER_CALL_15|))))) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1)))) (= |v_#valid_BEFORE_CALL_13| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5)))))) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1))) (and .cse6 (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse7 (select |v_#valid_BEFORE_CALL_13| .cse7)))) (= (select |v_#valid_BEFORE_CALL_15| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse8) 1))))) (and .cse6 (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|)) (= |v_#valid_BEFORE_CALL_13| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse9 (select |v_#valid_BEFORE_CALL_13| .cse9)))) (= (select |v_#valid_BEFORE_CALL_15| .cse10) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse10) 1))))))))) is different from false [2024-11-16 06:38:29,070 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse6 (exists ((v_arrayElimCell_93 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse11 (select |v_old(#valid)_AFTER_CALL_15| .cse11))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| v_arrayElimCell_93) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimCell_93) 0))))) (or (exists ((v_arrayElimCell_94 Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_94) 1) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimCell_94) 0) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1)))) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimCell_94) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| v_arrayElimCell_94) 1))) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse3) 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_#valid_BEFORE_CALL_12| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4))) |v_old(#valid)_AFTER_CALL_15|))))) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1)))) (= |v_#valid_BEFORE_CALL_13| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5)))))) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1))) (and .cse6 (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse7 (select |v_#valid_BEFORE_CALL_13| .cse7)))) (= (select |v_#valid_BEFORE_CALL_15| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse8) 1))))) (and .cse6 (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|)) (= |v_#valid_BEFORE_CALL_13| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse9 (select |v_#valid_BEFORE_CALL_13| .cse9)))) (= (select |v_#valid_BEFORE_CALL_15| .cse10) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse10) 1))))))))) is different from true [2024-11-16 06:38:29,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:38:29,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 353 treesize of output 369 [2024-11-16 06:38:29,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:38:29,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 297 treesize of output 349 [2024-11-16 06:38:29,415 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 7 [2024-11-16 06:38:29,455 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2024-11-16 06:38:29,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:38:29,557 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1055 Int) (v_ArrVal_1053 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_1055)) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_1053) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2024-11-16 06:38:32,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:38:32,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 92 [2024-11-16 06:38:32,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:38:32,380 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 170 treesize of output 169 [2024-11-16 06:38:32,388 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 72 treesize of output 56 [2024-11-16 06:38:35,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178801650] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:38:35,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 06:38:35,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 35 [2024-11-16 06:38:35,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196312046] [2024-11-16 06:38:35,342 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 06:38:35,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-16 06:38:35,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:38:35,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-16 06:38:35,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=667, Unknown=58, NotChecked=910, Total=1722 [2024-11-16 06:38:35,344 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand has 35 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 28 states have internal predecessors, (57), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-16 06:38:35,532 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |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_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2024-11-16 06:38:35,533 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |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_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2024-11-16 06:38:35,537 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select .cse0 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select .cse1 0) 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2024-11-16 06:38:35,539 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select .cse0 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select .cse1 0) 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from true [2024-11-16 06:38:35,542 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) (.cse3 (select .cse4 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse0 (select .cse4 0))) (and (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0) (= 0 (select .cse1 0))) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (select .cse1 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1))) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse3) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse3) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= (select |c_#valid| .cse3) 1) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))))) is different from false [2024-11-16 06:38:35,546 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) (.cse3 (select .cse4 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse0 (select .cse4 0))) (and (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0) (= 0 (select .cse1 0))) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (select .cse1 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1))) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse3) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse3) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= (select |c_#valid| .cse3) 1) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))))) is different from true [2024-11-16 06:38:35,553 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse6) .cse2))) (and (or (= .cse0 .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)) (= .cse2 0) (= (select |c_#valid| .cse3) 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |c_#valid| .cse4)))) (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse2) .cse5) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) .cse2) .cse5) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse2) .cse1) (= (select |c_#valid| .cse6) 1)))) is different from false [2024-11-16 06:38:35,557 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse6) .cse2))) (and (or (= .cse0 .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)) (= .cse2 0) (= (select |c_#valid| .cse3) 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |c_#valid| .cse4)))) (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse2) .cse5) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) .cse2) .cse5) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse2) .cse1) (= (select |c_#valid| .cse6) 1)))) is different from true [2024-11-16 06:38:35,561 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)|) (= |c_old(#length)| |c_#length|) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_6) 1))))) is different from false [2024-11-16 06:38:35,564 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)|) (= |c_old(#length)| |c_#length|) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_6) 1))))) is different from true [2024-11-16 06:38:35,569 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (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_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_6) 1))))) is different from false [2024-11-16 06:38:35,572 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (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_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_6) 1))))) is different from true [2024-11-16 06:38:35,579 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) (+ |c_node_create_#res#1.offset| 4)) |c_node_create_#in~data#1|) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#valid| (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse1 (select |c_#valid| .cse1)))) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_6) 1)))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse4) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse4 (select |c_#memory_$Pointer$#1.offset| .cse4))) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)))) is different from false [2024-11-16 06:38:35,583 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) (+ |c_node_create_#res#1.offset| 4)) |c_node_create_#in~data#1|) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#valid| (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse1 (select |c_#valid| .cse1)))) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_6) 1)))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse4) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse4 (select |c_#memory_$Pointer$#1.offset| .cse4))) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)))) is different from true [2024-11-16 06:38:35,596 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse6) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse8) .cse0))) (and (= .cse0 0) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1)))) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse2) 1)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse0) .cse4) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse5 .cse6) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse6)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse7 (select |v_old(#valid)_AFTER_CALL_15| .cse7))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_12| .cse5) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) .cse0) .cse4) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) 0) .cse6) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse0) .cse6)))) is different from false [2024-11-16 06:38:35,599 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse6) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse8) .cse0))) (and (= .cse0 0) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1)))) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse2) 1)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse0) .cse4) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse5 .cse6) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse6)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse7 (select |v_old(#valid)_AFTER_CALL_15| .cse7))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_12| .cse5) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) .cse0) .cse4) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) 0) .cse6) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse0) .cse6)))) is different from true [2024-11-16 06:38:35,609 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse8) .cse0))) (and (= .cse0 0) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1)))) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse2) 1)))) (or (= .cse3 .cse4) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse4)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse0) .cse6) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse7 (select |v_old(#valid)_AFTER_CALL_15| .cse7))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_12| .cse3) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) .cse0) .cse6) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) 0) .cse4) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse0) .cse4)))) is different from false [2024-11-16 06:38:35,612 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse8) .cse0))) (and (= .cse0 0) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1)))) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse2) 1)))) (or (= .cse3 .cse4) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse4)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse0) .cse6) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse7 (select |v_old(#valid)_AFTER_CALL_15| .cse7))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_12| .cse3) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) .cse0) .cse6) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) 0) .cse4) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse0) .cse4)))) is different from true [2024-11-16 06:38:35,623 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse5) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) .cse0) (= .cse1 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1)))) (or (= .cse4 .cse5) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse5)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse6 (select |v_old(#valid)_AFTER_CALL_15| .cse6))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| .cse7) .cse1) .cse5) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse0 (select (select |c_#memory_$Pointer$#1.offset| .cse7) .cse1)) (= (select (select |c_#memory_$Pointer$#1.base| .cse4) 0) .cse5)))) is different from false [2024-11-16 06:38:35,626 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse5) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) .cse0) (= .cse1 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1)))) (or (= .cse4 .cse5) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse5)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse6 (select |v_old(#valid)_AFTER_CALL_15| .cse6))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| .cse7) .cse1) .cse5) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse0 (select (select |c_#memory_$Pointer$#1.offset| .cse7) .cse1)) (= (select (select |c_#memory_$Pointer$#1.base| .cse4) 0) .cse5)))) is different from true [2024-11-16 06:38:35,642 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse6) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (= .cse0 (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2)) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3)))) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1)))) (or (= .cse5 .cse6) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse6)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse7 (select |v_old(#valid)_AFTER_CALL_15| .cse7))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_12| .cse5) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2) .cse6) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) 0) .cse6)))) is different from false [2024-11-16 06:38:35,645 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse6) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (= .cse0 (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2)) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3)))) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1)))) (or (= .cse5 .cse6) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse6)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse7 (select |v_old(#valid)_AFTER_CALL_15| .cse7))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_12| .cse5) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2) .cse6) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) 0) .cse6)))) is different from true [2024-11-16 06:38:35,656 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) .cse1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_12| .cse5) 1))) (or (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= .cse5 .cse0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse0)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse1) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) 0) .cse0)))) is different from false [2024-11-16 06:38:35,659 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) .cse1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_12| .cse5) 1))) (or (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= .cse5 .cse0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse0)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse1) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) 0) .cse0)))) is different from true [2024-11-16 06:38:35,676 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (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|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_old(#valid)_AFTER_CALL_15| .cse3))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 1))) (or (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= .cse4 .cse2) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse2)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| .cse4) 0) .cse2)))) is different from false [2024-11-16 06:38:35,680 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (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|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_15| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_old(#valid)_AFTER_CALL_15| .cse3))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 1))) (or (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= .cse4 .cse2) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse2)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| .cse4) 0) .cse2)))) is different from true [2024-11-16 06:38:35,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:38:35,803 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2024-11-16 06:38:35,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-16 06:38:35,803 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 28 states have internal predecessors, (57), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2024-11-16 06:38:35,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:38:35,804 INFO L225 Difference]: With dead ends: 88 [2024-11-16 06:38:35,804 INFO L226 Difference]: Without dead ends: 76 [2024-11-16 06:38:35,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 27 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=124, Invalid=770, Unknown=84, NotChecked=2214, Total=3192 [2024-11-16 06:38:35,805 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1091 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 06:38:35,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 403 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 265 Invalid, 0 Unknown, 1091 Unchecked, 0.2s Time] [2024-11-16 06:38:35,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-16 06:38:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-16 06:38:35,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 65 states have internal predecessors, (74), 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-16 06:38:35,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2024-11-16 06:38:35,817 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 41 [2024-11-16 06:38:35,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:38:35,817 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2024-11-16 06:38:35,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 28 states have internal predecessors, (57), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-16 06:38:35,818 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2024-11-16 06:38:35,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-16 06:38:35,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:38:35,819 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, 1, 1] [2024-11-16 06:38:35,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-16 06:38:36,019 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-16 06:38:36,020 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:38:36,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:38:36,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1251090796, now seen corresponding path program 1 times [2024-11-16 06:38:36,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:38:36,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230873230] [2024-11-16 06:38:36,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:38:36,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:38:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:36,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 06:38:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:36,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 06:38:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:37,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 06:38:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:37,231 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 06:38:37,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:38:37,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230873230] [2024-11-16 06:38:37,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230873230] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:38:37,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875144602] [2024-11-16 06:38:37,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:38:37,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:38:37,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:38:37,233 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-16 06:38:37,242 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-16 06:38:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:37,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 166 conjuncts are in the unsatisfiable core [2024-11-16 06:38:37,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:38:37,454 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-16 06:38:37,640 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-16 06:38:37,696 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-16 06:38:37,696 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-16 06:38:37,744 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-16 06:38:37,750 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-16 06:38:37,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-16 06:38:37,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-16 06:38:37,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-16 06:38:38,001 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-16 06:38:38,006 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-16 06:38:38,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-16 06:38:38,214 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-16 06:38:38,215 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-16 06:38:38,235 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-16 06:38:38,236 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-16 06:38:38,257 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-16 06:38:38,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-16 06:38:39,165 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-16 06:38:39,165 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 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-16 06:38:39,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 15 [2024-11-16 06:38:39,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 122 [2024-11-16 06:38:39,182 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2024-11-16 06:38:39,196 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2024-11-16 06:38:39,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 63 [2024-11-16 06:38:39,214 INFO L349 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2024-11-16 06:38:39,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 194 treesize of output 105 [2024-11-16 06:38:39,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 33 [2024-11-16 06:38:39,244 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 13 treesize of output 11 [2024-11-16 06:38:39,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 216 treesize of output 137 [2024-11-16 06:38:39,260 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-16 06:38:39,389 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-16 06:38:39,389 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-16 06:38:39,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:38:39,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2024-11-16 06:38:39,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:38:39,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2024-11-16 06:38:39,700 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 79 treesize of output 51 [2024-11-16 06:38:39,706 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-16 06:38:39,706 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 48 treesize of output 23 [2024-11-16 06:38:39,708 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:38:39,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:38:42,042 INFO L349 Elim1Store]: treesize reduction 437, result has 48.6 percent of original size [2024-11-16 06:38:42,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 4194 treesize of output 3991 [2024-11-16 06:38:46,721 INFO L349 Elim1Store]: treesize reduction 666, result has 84.1 percent of original size [2024-11-16 06:38:46,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 1 disjoint index pairs (out of 91 index pairs), introduced 17 new quantified variables, introduced 90 case distinctions, treesize of input 3086 treesize of output 5830 [2024-11-16 06:38:47,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:38:47,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 3046 treesize of output 2967