./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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/dll2c_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:07:07,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:07:07,425 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:07:07,428 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:07:07,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:07:07,449 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:07:07,450 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:07:07,451 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:07:07,451 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:07:07,453 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:07:07,453 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:07:07,453 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:07:07,454 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:07:07,455 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:07:07,456 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:07:07,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:07:07,456 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:07:07,456 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:07:07,456 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:07:07,456 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:07:07,457 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:07:07,457 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:07:07,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:07:07,461 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:07:07,461 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:07:07,461 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:07:07,461 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:07:07,461 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:07:07,462 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:07:07,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:07:07,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:07:07,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:07:07,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:07:07,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:07:07,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:07:07,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:07:07,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:07:07,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:07:07,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:07:07,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:07:07,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:07:07,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:07:07,464 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 -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2024-11-09 22:07:07,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:07:07,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:07:07,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:07:07,666 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:07:07,666 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:07:07,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2024-11-09 22:07:08,860 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:07:09,031 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:07:09,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2024-11-09 22:07:09,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6564a671b/cb3bb76fd7354890815366fcb422373d/FLAGe9cb1fdcb [2024-11-09 22:07:09,051 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6564a671b/cb3bb76fd7354890815366fcb422373d [2024-11-09 22:07:09,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:07:09,054 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:07:09,055 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:07:09,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:07:09,059 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:07:09,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:07:09" (1/1) ... [2024-11-09 22:07:09,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d53485f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:09, skipping insertion in model container [2024-11-09 22:07:09,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:07:09" (1/1) ... [2024-11-09 22:07:09,089 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:07:09,331 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2024-11-09 22:07:09,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:07:09,341 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:07:09,378 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2024-11-09 22:07:09,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:07:09,402 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:07:09,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:09 WrapperNode [2024-11-09 22:07:09,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:07:09,404 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:07:09,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:07:09,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:07:09,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:09" (1/1) ... [2024-11-09 22:07:09,421 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:09" (1/1) ... [2024-11-09 22:07:09,444 INFO L138 Inliner]: procedures = 127, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 182 [2024-11-09 22:07:09,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:07:09,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:07:09,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:07:09,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:07:09,453 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:09" (1/1) ... [2024-11-09 22:07:09,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:09" (1/1) ... [2024-11-09 22:07:09,456 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:09" (1/1) ... [2024-11-09 22:07:09,478 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 26, 12]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 17, 1]. [2024-11-09 22:07:09,479 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:09" (1/1) ... [2024-11-09 22:07:09,479 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:09" (1/1) ... [2024-11-09 22:07:09,493 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:09" (1/1) ... [2024-11-09 22:07:09,493 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:09" (1/1) ... [2024-11-09 22:07:09,495 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:09" (1/1) ... [2024-11-09 22:07:09,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:09" (1/1) ... [2024-11-09 22:07:09,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:07:09,504 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:07:09,505 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:07:09,505 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:07:09,506 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:09" (1/1) ... [2024-11-09 22:07:09,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:07:09,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:07:09,533 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-09 22:07:09,535 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-09 22:07:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 22:07:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 22:07:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 22:07:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 22:07:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 22:07:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 22:07:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 22:07:09,578 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 22:07:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 22:07:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:07:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 22:07:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 22:07:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 22:07:09,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 22:07:09,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 22:07:09,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 22:07:09,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 22:07:09,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 22:07:09,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 22:07:09,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 22:07:09,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 22:07:09,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:07:09,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 22:07:09,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 22:07:09,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:07:09,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:07:09,705 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:07:09,707 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:07:09,942 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L642: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2024-11-09 22:07:09,957 INFO L1247 $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-09 22:07:09,977 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-11-09 22:07:09,977 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:07:09,990 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:07:09,990 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:07:09,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:07:09 BoogieIcfgContainer [2024-11-09 22:07:09,990 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:07:09,991 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:07:09,992 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:07:09,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:07:09,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:07:09" (1/3) ... [2024-11-09 22:07:09,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209efe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:07:09, skipping insertion in model container [2024-11-09 22:07:09,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:09" (2/3) ... [2024-11-09 22:07:09,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209efe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:07:09, skipping insertion in model container [2024-11-09 22:07:09,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:07:09" (3/3) ... [2024-11-09 22:07:09,996 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2024-11-09 22:07:10,008 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:07:10,008 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 22:07:10,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:07:10,055 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;@1a7727e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:07:10,055 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 22:07:10,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 42 states have internal predecessors, (61), 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-09 22:07:10,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 22:07:10,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:07:10,063 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:07:10,064 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:07:10,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:07:10,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1403905069, now seen corresponding path program 1 times [2024-11-09 22:07:10,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:07:10,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905172147] [2024-11-09 22:07:10,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:10,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:07:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:10,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:07:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:10,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 22:07:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:10,343 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-09 22:07:10,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:07:10,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905172147] [2024-11-09 22:07:10,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905172147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:07:10,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:07:10,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 22:07:10,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766464143] [2024-11-09 22:07:10,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:07:10,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 22:07:10,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:07:10,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 22:07:10,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:07:10,369 INFO L87 Difference]: Start difference. First operand has 47 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 42 states have internal predecessors, (61), 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 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:07:10,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:07:10,433 INFO L93 Difference]: Finished difference Result 83 states and 118 transitions. [2024-11-09 22:07:10,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 22:07:10,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-11-09 22:07:10,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:07:10,442 INFO L225 Difference]: With dead ends: 83 [2024-11-09 22:07:10,442 INFO L226 Difference]: Without dead ends: 37 [2024-11-09 22:07:10,444 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-09 22:07:10,447 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:07:10,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:07:10,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-09 22:07:10,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-09 22:07:10,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 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-09 22:07:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2024-11-09 22:07:10,473 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 26 [2024-11-09 22:07:10,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:07:10,474 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2024-11-09 22:07:10,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:07:10,474 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2024-11-09 22:07:10,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 22:07:10,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:07:10,475 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:07:10,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:07:10,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:07:10,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:07:10,476 INFO L85 PathProgramCache]: Analyzing trace with hash -787176658, now seen corresponding path program 1 times [2024-11-09 22:07:10,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:07:10,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186778312] [2024-11-09 22:07:10,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:10,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:07:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:10,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:07:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:10,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 22:07:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:10,680 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-09 22:07:10,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:07:10,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186778312] [2024-11-09 22:07:10,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186778312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:07:10,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:07:10,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 22:07:10,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110350834] [2024-11-09 22:07:10,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:07:10,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:07:10,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:07:10,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:07:10,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:07:10,684 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-09 22:07:10,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:07:10,740 INFO L93 Difference]: Finished difference Result 70 states and 91 transitions. [2024-11-09 22:07:10,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:07:10,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 28 [2024-11-09 22:07:10,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:07:10,742 INFO L225 Difference]: With dead ends: 70 [2024-11-09 22:07:10,743 INFO L226 Difference]: Without dead ends: 43 [2024-11-09 22:07:10,743 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-09 22:07:10,744 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:07:10,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 111 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:07:10,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-09 22:07:10,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2024-11-09 22:07:10,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 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-09 22:07:10,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2024-11-09 22:07:10,755 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 28 [2024-11-09 22:07:10,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:07:10,755 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2024-11-09 22:07:10,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-09 22:07:10,755 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2024-11-09 22:07:10,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 22:07:10,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:07:10,757 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:07:10,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:07:10,758 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:07:10,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:07:10,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1175390146, now seen corresponding path program 1 times [2024-11-09 22:07:10,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:07:10,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55689895] [2024-11-09 22:07:10,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:10,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:07:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:10,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:07:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:10,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:07:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:10,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:07:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:10,925 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 22:07:10,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:07:10,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55689895] [2024-11-09 22:07:10,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55689895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:07:10,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:07:10,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 22:07:10,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551581095] [2024-11-09 22:07:10,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:07:10,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:07:10,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:07:10,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:07:10,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:07:10,930 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 22:07:10,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:07:10,984 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2024-11-09 22:07:10,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:07:10,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-11-09 22:07:10,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:07:10,986 INFO L225 Difference]: With dead ends: 55 [2024-11-09 22:07:10,986 INFO L226 Difference]: Without dead ends: 42 [2024-11-09 22:07:10,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-09 22:07:10,987 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:07:10,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:07:10,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-09 22:07:10,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-09 22:07:10,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 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-09 22:07:10,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2024-11-09 22:07:10,994 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 39 [2024-11-09 22:07:10,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:07:10,994 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2024-11-09 22:07:10,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 22:07:10,995 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2024-11-09 22:07:10,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 22:07:10,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:07:10,997 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:07:10,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 22:07:10,997 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:07:10,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:07:10,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1137681055, now seen corresponding path program 1 times [2024-11-09 22:07:10,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:07:10,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067812441] [2024-11-09 22:07:10,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:10,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:07:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:11,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:07:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:11,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:07:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:11,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:07:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:11,218 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 22:07:11,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:07:11,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067812441] [2024-11-09 22:07:11,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067812441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:07:11,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:07:11,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:07:11,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614776532] [2024-11-09 22:07:11,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:07:11,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:07:11,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:07:11,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:07:11,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:07:11,221 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 22:07:11,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:07:11,278 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2024-11-09 22:07:11,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:07:11,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2024-11-09 22:07:11,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:07:11,279 INFO L225 Difference]: With dead ends: 60 [2024-11-09 22:07:11,279 INFO L226 Difference]: Without dead ends: 44 [2024-11-09 22:07:11,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:07:11,280 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 29 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:07:11,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 119 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:07:11,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-09 22:07:11,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2024-11-09 22:07:11,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 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-09 22:07:11,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2024-11-09 22:07:11,289 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 41 [2024-11-09 22:07:11,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:07:11,290 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2024-11-09 22:07:11,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 22:07:11,290 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2024-11-09 22:07:11,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 22:07:11,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:07:11,292 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-09 22:07:11,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 22:07:11,292 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:07:11,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:07:11,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1168274785, now seen corresponding path program 1 times [2024-11-09 22:07:11,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:07:11,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560946387] [2024-11-09 22:07:11,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:11,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:07:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:12,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:07:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:12,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:07:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:13,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:07:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:13,274 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-09 22:07:13,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:07:13,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560946387] [2024-11-09 22:07:13,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560946387] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:07:13,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623394942] [2024-11-09 22:07:13,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:13,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:07:13,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:07:13,277 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-09 22:07:13,278 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-09 22:07:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:13,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 129 conjuncts are in the unsatisfiable core [2024-11-09 22:07:13,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:07:13,818 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-09 22:07:13,999 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-09 22:07:14,078 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 22:07:14,079 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-09 22:07:14,155 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-09 22:07:14,166 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-09 22:07:14,234 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 22:07:14,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-09 22:07:14,246 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-09 22:07:14,417 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2024-11-09 22:07:14,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 115 [2024-11-09 22:07:14,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:14,424 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 28 treesize of output 25 [2024-11-09 22:07:14,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2024-11-09 22:07:14,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 51 [2024-11-09 22:07:14,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 26 [2024-11-09 22:07:14,578 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-09 22:07:14,582 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-09 22:07:14,586 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-09 22:07:14,806 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 22:07:14,807 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-09 22:07:14,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:14,837 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-09 22:07:14,854 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-09 22:07:14,854 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-09 22:07:15,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2024-11-09 22:07:15,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 26 [2024-11-09 22:07:15,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2024-11-09 22:07:15,291 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-09 22:07:15,361 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-09 22:07:15,362 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:07:15,420 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_753 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_753) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_754) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_756) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= v_ArrVal_753 (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_753 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)))))) is different from false [2024-11-09 22:07:15,441 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_753 (Array Int Int))) (or (not (= v_ArrVal_753 (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select v_ArrVal_753 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_753) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_754) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) v_ArrVal_756) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2024-11-09 22:07:15,457 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_753 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (= v_ArrVal_753 (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_753 .cse1)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_753) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_754) (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1) v_ArrVal_756) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2024-11-09 22:07:15,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623394942] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:07:15,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:07:15,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 45 [2024-11-09 22:07:15,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211849303] [2024-11-09 22:07:15,584 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:07:15,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-09 22:07:15,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:07:15,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-09 22:07:15,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2016, Unknown=3, NotChecked=276, Total=2450 [2024-11-09 22:07:15,586 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 45 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 36 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 22:07:16,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:07:16,968 INFO L93 Difference]: Finished difference Result 85 states and 109 transitions. [2024-11-09 22:07:16,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 22:07:16,968 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 36 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 41 [2024-11-09 22:07:16,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:07:16,969 INFO L225 Difference]: With dead ends: 85 [2024-11-09 22:07:16,969 INFO L226 Difference]: Without dead ends: 82 [2024-11-09 22:07:16,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=283, Invalid=3632, Unknown=3, NotChecked=372, Total=4290 [2024-11-09 22:07:16,971 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 68 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 22:07:16,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 683 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 22:07:16,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-09 22:07:16,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 64. [2024-11-09 22:07:16,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 56 states have (on average 1.25) internal successors, (70), 56 states have internal predecessors, (70), 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-09 22:07:16,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2024-11-09 22:07:16,979 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 41 [2024-11-09 22:07:16,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:07:16,979 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2024-11-09 22:07:16,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 36 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 22:07:16,980 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2024-11-09 22:07:16,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 22:07:16,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:07:16,980 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-09 22:07:16,996 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-09 22:07:17,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:07:17,183 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:07:17,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:07:17,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1405213570, now seen corresponding path program 1 times [2024-11-09 22:07:17,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:07:17,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124548893] [2024-11-09 22:07:17,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:17,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:07:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:17,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:07:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:17,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:07:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:17,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:07:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 22:07:17,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:07:17,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124548893] [2024-11-09 22:07:17,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124548893] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:07:17,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815401307] [2024-11-09 22:07:17,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:17,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:07:17,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:07:17,318 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-09 22:07:17,330 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-09 22:07:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:17,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 22:07:17,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:07:17,508 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 22:07:17,509 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:07:17,573 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 22:07:17,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815401307] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:07:17,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:07:17,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2024-11-09 22:07:17,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709650501] [2024-11-09 22:07:17,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:07:17,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 22:07:17,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:07:17,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 22:07:17,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 22:07:17,575 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 22:07:17,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:07:17,678 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2024-11-09 22:07:17,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 22:07:17,678 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-11-09 22:07:17,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:07:17,680 INFO L225 Difference]: With dead ends: 83 [2024-11-09 22:07:17,680 INFO L226 Difference]: Without dead ends: 69 [2024-11-09 22:07:17,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-09 22:07:17,680 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 2 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:07:17,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 258 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:07:17,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-09 22:07:17,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-11-09 22:07:17,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 60 states have internal predecessors, (76), 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-09 22:07:17,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2024-11-09 22:07:17,691 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 43 [2024-11-09 22:07:17,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:07:17,691 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2024-11-09 22:07:17,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 22:07:17,691 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2024-11-09 22:07:17,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 22:07:17,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:07:17,692 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-09 22:07:17,707 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-09 22:07:17,892 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,SelfDestructingSolverStorable5 [2024-11-09 22:07:17,893 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:07:17,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:07:17,893 INFO L85 PathProgramCache]: Analyzing trace with hash -517709889, now seen corresponding path program 1 times [2024-11-09 22:07:17,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:07:17,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045776216] [2024-11-09 22:07:17,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:17,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:07:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:18,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:07:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:18,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:07:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:18,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:07:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:18,130 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 22:07:18,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:07:18,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045776216] [2024-11-09 22:07:18,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045776216] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:07:18,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218616414] [2024-11-09 22:07:18,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:18,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:07:18,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:07:18,132 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-09 22:07:18,133 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-09 22:07:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:18,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 22:07:18,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:07:18,368 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-09 22:07:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 22:07:18,392 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:07:18,428 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 22:07:18,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218616414] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:07:18,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:07:18,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 16 [2024-11-09 22:07:18,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98594485] [2024-11-09 22:07:18,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:07:18,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 22:07:18,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:07:18,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 22:07:18,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-09 22:07:18,429 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 14 states have internal predecessors, (46), 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-09 22:07:22,441 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-09 22:07:26,460 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-09 22:07:30,472 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-09 22:07:34,482 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-09 22:07:38,503 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-09 22:07:42,669 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-09 22:07:46,706 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-09 22:07:50,722 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-09 22:07:50,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:07:50,725 INFO L93 Difference]: Finished difference Result 124 states and 157 transitions. [2024-11-09 22:07:50,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 22:07:50,726 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 14 states have internal predecessors, (46), 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 43 [2024-11-09 22:07:50,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:07:50,726 INFO L225 Difference]: With dead ends: 124 [2024-11-09 22:07:50,726 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 22:07:50,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2024-11-09 22:07:50,727 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 48 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:07:50,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 434 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 277 Invalid, 8 Unknown, 0 Unchecked, 32.2s Time] [2024-11-09 22:07:50,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 22:07:50,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2024-11-09 22:07:50,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 63 states have internal predecessors, (76), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 22:07:50,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2024-11-09 22:07:50,737 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 43 [2024-11-09 22:07:50,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:07:50,738 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2024-11-09 22:07:50,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 14 states have internal predecessors, (46), 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-09 22:07:50,738 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2024-11-09 22:07:50,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 22:07:50,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:07:50,738 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:07:50,752 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-09 22:07:50,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:07:50,941 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:07:50,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:07:50,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1374619840, now seen corresponding path program 2 times [2024-11-09 22:07:50,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:07:50,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587152309] [2024-11-09 22:07:50,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:50,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:07:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:51,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:07:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:51,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:07:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:51,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:07:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:51,120 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 22:07:51,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:07:51,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587152309] [2024-11-09 22:07:51,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587152309] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:07:51,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654199640] [2024-11-09 22:07:51,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:07:51,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:07:51,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:07:51,122 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-09 22:07:51,124 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-09 22:07:51,295 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:07:51,295 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:07:51,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 22:07:51,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:07:51,349 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 22:07:51,349 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:07:51,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654199640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:07:51,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 22:07:51,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2024-11-09 22:07:51,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961920342] [2024-11-09 22:07:51,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:07:51,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:07:51,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:07:51,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:07:51,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:07:51,351 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 22:07:51,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:07:51,381 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2024-11-09 22:07:51,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:07:51,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2024-11-09 22:07:51,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:07:51,383 INFO L225 Difference]: With dead ends: 88 [2024-11-09 22:07:51,383 INFO L226 Difference]: Without dead ends: 70 [2024-11-09 22:07:51,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-09 22:07:51,385 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 23 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:07:51,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 89 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:07:51,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-09 22:07:51,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2024-11-09 22:07:51,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 58 states have internal predecessors, (66), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 22:07:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2024-11-09 22:07:51,398 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 43 [2024-11-09 22:07:51,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:07:51,399 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2024-11-09 22:07:51,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 22:07:51,399 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2024-11-09 22:07:51,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 22:07:51,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:07:51,400 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, 1] [2024-11-09 22:07:51,417 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-09 22:07:51,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:07:51,601 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:07:51,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:07:51,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2041917598, now seen corresponding path program 1 times [2024-11-09 22:07:51,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:07:51,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413983751] [2024-11-09 22:07:51,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:51,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:07:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:52,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:07:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:52,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:07:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:53,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:07:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:53,228 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-09 22:07:53,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:07:53,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413983751] [2024-11-09 22:07:53,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413983751] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:07:53,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433962860] [2024-11-09 22:07:53,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:53,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:07:53,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:07:53,230 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-09 22:07:53,231 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-09 22:07:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:53,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 155 conjuncts are in the unsatisfiable core [2024-11-09 22:07:53,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:07:53,553 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-09 22:07:53,763 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from false [2024-11-09 22:07:53,765 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from true [2024-11-09 22:07:53,774 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-09 22:07:53,788 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-09 22:07:53,792 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from false [2024-11-09 22:07:53,793 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from true [2024-11-09 22:07:53,809 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 22:07:53,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 22:07:53,833 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 22:07:53,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 22:07:53,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 22:07:53,844 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) .cse0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))))) is different from false [2024-11-09 22:07:53,846 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) .cse0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))))) is different from true [2024-11-09 22:07:53,868 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) is different from false [2024-11-09 22:07:53,870 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) is different from true [2024-11-09 22:07:53,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:53,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:53,934 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 30 treesize of output 27 [2024-11-09 22:07:53,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:53,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:53,941 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 30 treesize of output 27 [2024-11-09 22:07:53,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2024-11-09 22:07:53,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2024-11-09 22:07:53,975 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)) 1)))) is different from false [2024-11-09 22:07:53,977 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)) 1)))) is different from true [2024-11-09 22:07:54,008 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0))) is different from false [2024-11-09 22:07:54,010 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0))) is different from true [2024-11-09 22:07:54,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2024-11-09 22:07:54,036 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-09 22:07:54,049 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_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_33 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_33) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0))))) is different from false [2024-11-09 22:07:54,051 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_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_33 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_33) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0))))) is different from true [2024-11-09 22:07:54,074 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_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_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_33 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_33) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0))))) is different from false [2024-11-09 22:07:54,076 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_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_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_33 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_33) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0))))) is different from true [2024-11-09 22:07:54,110 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-09 22:07:54,128 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 8)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_33 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_33) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0))))) is different from false [2024-11-09 22:07:54,130 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 8)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_33 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_33) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0))))) is different from true [2024-11-09 22:07:54,184 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 22:07:54,184 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-09 22:07:54,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:54,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-11-09 22:07:54,237 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_33 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_33) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |v_old(#valid)_AFTER_CALL_15| .cse3))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) 1))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= .cse2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0))) is different from false [2024-11-09 22:07:54,239 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_33 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_33) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |v_old(#valid)_AFTER_CALL_15| .cse3))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) 1))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= .cse2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0))) is different from true [2024-11-09 22:07:54,306 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_33 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_33) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |v_old(#valid)_AFTER_CALL_15| .cse3))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)))) is different from false [2024-11-09 22:07:54,309 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_33 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_33) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |v_old(#valid)_AFTER_CALL_15| .cse3))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)))) is different from true [2024-11-09 22:07:54,425 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0)) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_33 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_33) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |v_old(#valid)_AFTER_CALL_15| .cse3))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)))) is different from false [2024-11-09 22:07:54,428 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0)) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_33 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_33) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |v_old(#valid)_AFTER_CALL_15| .cse3))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)))) is different from true [2024-11-09 22:07:54,589 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 133 treesize of output 37 [2024-11-09 22:07:54,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:54,599 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 71 treesize of output 25 [2024-11-09 22:07:54,605 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 102 treesize of output 49 [2024-11-09 22:07:54,619 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2024-11-09 22:07:54,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 72 [2024-11-09 22:07:54,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 19 [2024-11-09 22:07:54,651 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:07:54,656 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 22:07:54,664 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:07:54,665 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 22:07:54,677 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:07:54,679 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 22:07:54,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 185 [2024-11-09 22:07:54,704 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_33 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_33) 1)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse3 .cse2)) (exists ((v_arrayElimCell_39 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_39) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_39) 4) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) is different from false [2024-11-09 22:07:54,706 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_33 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_33) 1)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse3 .cse2)) (exists ((v_arrayElimCell_39 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_39) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_39) 4) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) is different from true [2024-11-09 22:07:54,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:54,731 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 114 treesize of output 78 [2024-11-09 22:07:54,829 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 8)) (exists ((v_arrayElimCell_39 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_39) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_39) 4) 0))) (or (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_33 Int)) (and (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_33) 1))))))) is different from false [2024-11-09 22:07:54,834 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 8)) (exists ((v_arrayElimCell_39 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_39) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_39) 4) 0))) (or (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_33 Int)) (and (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_33) 1))))))) is different from true [2024-11-09 22:07:54,904 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 47 treesize of output 27 [2024-11-09 22:07:54,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:54,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 68 [2024-11-09 22:07:54,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:54,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:54,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 22:07:55,001 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((v_arrayElimCell_39 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int)) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_15| .cse0))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_39) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1)))) is different from false [2024-11-09 22:07:55,005 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((v_arrayElimCell_39 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int)) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_15| .cse0))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_39) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1)))) is different from true [2024-11-09 22:07:55,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 22:07:55,033 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2024-11-09 22:07:55,033 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:07:55,124 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1745 (Array Int Int)) (v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1752 (Array Int Int)) (v_ArrVal_1751 Int) (v_ArrVal_1749 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1754)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1746) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1745) (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1752) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1749) .cse1) .cse2)) (+ (select (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 v_ArrVal_1751) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))))) (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) .cse1) .cse2) 8)))) (not (= (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1746 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1746 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1746))))) is different from false [2024-11-09 22:07:55,167 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1745 (Array Int Int)) (v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1752 (Array Int Int)) (v_ArrVal_1751 Int) (v_ArrVal_1749 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1754)) (.cse8 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#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|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1746) .cse1 v_ArrVal_1745) (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1752) .cse1 v_ArrVal_1749) .cse3) .cse4)) (+ (select (select (let ((.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse6 (select .cse9 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (let ((.cse5 (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse9 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 v_ArrVal_1751) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse6))))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ .cse6 4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))) .cse3) .cse4) 8))))) (not (= (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1746 .cse8)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1746 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1746))))) is different from false [2024-11-09 22:07:55,197 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1745 (Array Int Int)) (v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1752 (Array Int Int)) (v_ArrVal_1751 Int) (v_ArrVal_1749 (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse0 (store |c_#memory_int#1| .cse3 v_ArrVal_1754)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 4))) (or (not (= (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 (select v_ArrVal_1746 .cse1)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1746 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1746)) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse3)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse2 (select .cse4 .cse5)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1746) .cse2 v_ArrVal_1745) (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1752) .cse2 v_ArrVal_1749) .cse6) .cse7)) (+ (select (select (let ((.cse11 (select |c_#memory_$Pointer$#1.offset| .cse3))) (let ((.cse9 (select .cse11 .cse5))) (let ((.cse8 (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| .cse3 (store .cse11 .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 v_ArrVal_1751) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| .cse9))))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ 4 .cse9) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|))))) .cse6) .cse7) 8))))))))) is different from false [2024-11-09 22:07:55,352 INFO L349 Elim1Store]: treesize reduction 563, result has 50.5 percent of original size [2024-11-09 22:07:55,352 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 2 case distinctions, treesize of input 5833 treesize of output 5841 [2024-11-09 22:07:55,368 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 2561 treesize of output 1677 [2024-11-09 22:07:55,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:55,403 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 623 treesize of output 625 [2024-11-09 22:07:55,472 INFO L349 Elim1Store]: treesize reduction 1123, result has 38.0 percent of original size [2024-11-09 22:07:55,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 775 treesize of output 1232 [2024-11-09 22:07:55,530 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 225 treesize of output 4 [2024-11-09 22:07:55,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:55,925 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 1885 treesize of output 2114 [2024-11-09 22:07:56,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:56,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 347 treesize of output 347 [2024-11-09 22:07:56,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2024-11-09 22:07:56,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2024-11-09 22:07:56,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:56,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1153 treesize of output 1599 [2024-11-09 22:08:03,083 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse90 (select |c_#memory_$Pointer$#1.offset| .cse3)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| .cse3)) (.cse24 (store .cse90 .cse7 0))) (let ((.cse23 (store |c_#memory_$Pointer$#1.offset| .cse3 .cse24)) (.cse25 (select .cse90 .cse7)) (.cse16 (select .cse15 .cse7)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (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_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| Int)) (or (forall ((v_prenex_6 Int) (v_ArrVal_1763 (Array Int Int)) (v_ArrVal_1762 (Array Int Int)) (v_ArrVal_1751 Int) (v_prenex_5 (Array Int Int))) (or (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1762) .cse3) .cse7))) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_prenex_5))) (let ((.cse6 (select .cse5 .cse3))) (let ((.cse2 (select .cse6 .cse7))) (let ((.cse0 (let ((.cse4 (store .cse6 .cse7 0))) (store (store |c_#memory_$Pointer$#1.offset| .cse3 .cse4) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| (store (store (select (store .cse5 .cse3 .cse4) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 4 v_prenex_6) 0 .cse2))))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ .cse2 4) 0)))))) .cse8) .cse9) (select (select (let ((.cse13 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1763))) (let ((.cse14 (select .cse13 .cse3))) (let ((.cse11 (select .cse14 .cse7))) (let ((.cse10 (let ((.cse12 (store .cse14 .cse7 0))) (store (store |c_#memory_$Pointer$#1.offset| .cse3 .cse12) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| (store (store (select (store .cse13 .cse3 .cse12) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 4 v_ArrVal_1751) 0 .cse11))))) (store .cse10 .cse1 (store (select .cse10 .cse1) (+ 4 .cse11) 0)))))) .cse8) .cse9))) (forall ((v_ArrVal_1752 (Array Int Int)) (v_ArrVal_1749 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse15 .cse7 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1752) .cse16 v_ArrVal_1749) .cse8) .cse9) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 0)))) (forall ((v_prenex_6 Int) (v_ArrVal_1762 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| Int) (v_prenex_5 (Array Int Int))) (or (= (select (select (let ((.cse21 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_prenex_5))) (let ((.cse22 (select .cse21 .cse3))) (let ((.cse19 (select .cse22 .cse7))) (let ((.cse17 (let ((.cse20 (store .cse22 .cse7 0))) (store (store |c_#memory_$Pointer$#1.offset| .cse3 .cse20) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| (store (store (select (store .cse21 .cse3 .cse20) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 4 v_prenex_6) 0 .cse19)))) (.cse18 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1762) .cse3) .cse7))) (store .cse17 .cse18 (store (select .cse17 .cse18) (+ .cse19 4) 0)))))) .cse8) .cse9) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 0)) (forall ((v_ArrVal_1763 (Array Int Int)) (v_ArrVal_1751 Int)) (= 0 (select (select (store .cse23 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| (store (store (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1763) .cse3 .cse24) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 4 v_ArrVal_1751) 0 .cse25)) .cse8) .cse9))) (forall ((v_ArrVal_1752 (Array Int Int)) (v_ArrVal_1749 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse15 .cse7 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1752) .cse16 v_ArrVal_1749) .cse8) .cse9) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|))))) (forall ((v_ArrVal_1752 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| Int) (v_ArrVal_1749 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 0)) (forall ((v_prenex_6 Int) (v_ArrVal_1763 (Array Int Int)) (v_ArrVal_1762 (Array Int Int)) (v_ArrVal_1751 Int) (v_prenex_5 (Array Int Int))) (let ((.cse30 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_prenex_5))) (or (= (select (select (let ((.cse31 (select .cse30 .cse3))) (let ((.cse28 (select .cse31 .cse7))) (let ((.cse26 (let ((.cse29 (store .cse31 .cse7 0))) (store (store |c_#memory_$Pointer$#1.offset| .cse3 .cse29) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| (store (store (select (store .cse30 .cse3 .cse29) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 4 v_prenex_6) 0 .cse28)))) (.cse27 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1762) .cse3) .cse7))) (store .cse26 .cse27 (store (select .cse26 .cse27) (+ .cse28 4) 0))))) .cse8) .cse9) 0) (= (select (select (store .cse23 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| (store (store (select (store .cse30 .cse3 .cse24) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 4 v_prenex_6) 0 .cse25)) .cse8) .cse9) (select (select (store .cse23 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| (store (store (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1763) .cse3 .cse24) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 4 v_ArrVal_1751) 0 .cse25)) .cse8) .cse9))))) (not (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse15 .cse7 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1752) .cse16 v_ArrVal_1749) .cse8) .cse9) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|)))) (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 0)) (forall ((v_prenex_6 Int) (v_ArrVal_1763 (Array Int Int)) (v_ArrVal_1762 (Array Int Int)) (v_ArrVal_1751 Int) (v_prenex_5 (Array Int Int))) (let ((.cse43 (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1762) .cse3))) (let ((.cse33 (select .cse43 .cse7))) (or (= (select (select (let ((.cse36 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_prenex_5))) (let ((.cse37 (select .cse36 .cse3))) (let ((.cse34 (select .cse37 .cse7))) (let ((.cse32 (let ((.cse35 (store .cse37 .cse7 0))) (store (store |c_#memory_$Pointer$#1.offset| .cse3 .cse35) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| (store (store (select (store .cse36 .cse3 .cse35) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 4 v_prenex_6) 0 .cse34))))) (store .cse32 .cse33 (store (select .cse32 .cse33) (+ .cse34 4) 0)))))) .cse8) .cse9) (select (select (let ((.cse41 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1763))) (let ((.cse42 (select .cse41 .cse3))) (let ((.cse39 (select .cse42 .cse7))) (let ((.cse38 (let ((.cse40 (store .cse42 .cse7 0))) (store (store |c_#memory_$Pointer$#1.offset| .cse3 .cse40) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| (store (store (select (store .cse41 .cse3 .cse40) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 4 v_ArrVal_1751) 0 .cse39))))) (store .cse38 .cse33 (store (select .cse38 .cse33) (+ 4 .cse39) 0)))))) .cse8) .cse9)) (forall ((v_ArrVal_1752 (Array Int Int)) (v_ArrVal_1749 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse43 .cse7 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1752) .cse33 v_ArrVal_1749) .cse8) .cse9) .cse33))))))))) (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 0)) (forall ((v_ArrVal_1752 (Array Int Int)) (v_ArrVal_1749 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse15 .cse7 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1752) .cse16 v_ArrVal_1749) .cse8) .cse9) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|)) (forall ((v_prenex_6 Int) (v_ArrVal_1763 (Array Int Int)) (v_ArrVal_1762 (Array Int Int)) (v_ArrVal_1751 Int) (v_prenex_5 (Array Int Int))) (let ((.cse48 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_prenex_5))) (or (= (select (select (let ((.cse49 (select .cse48 .cse3))) (let ((.cse46 (select .cse49 .cse7))) (let ((.cse44 (let ((.cse47 (store .cse49 .cse7 0))) (store (store |c_#memory_$Pointer$#1.offset| .cse3 .cse47) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| (store (store (select (store .cse48 .cse3 .cse47) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 4 v_prenex_6) 0 .cse46)))) (.cse45 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1762) .cse3) .cse7))) (store .cse44 .cse45 (store (select .cse44 .cse45) (+ .cse46 4) 0))))) .cse8) .cse9) 0) (= (select (select (store .cse23 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| (store (store (select (store .cse48 .cse3 .cse24) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 4 v_prenex_6) 0 .cse25)) .cse8) .cse9) (select (select (store .cse23 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| (store (store (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1763) .cse3 .cse24) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 4 v_ArrVal_1751) 0 .cse25)) .cse8) .cse9))))))) (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 0)) (forall ((v_prenex_6 Int) (v_ArrVal_1763 (Array Int Int)) (v_ArrVal_1762 (Array Int Int)) (v_ArrVal_1751 Int) (v_prenex_5 (Array Int Int))) (let ((.cse53 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1763))) (or (= (select (select (let ((.cse51 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_prenex_5))) (let ((.cse52 (select .cse51 .cse3))) (let ((.cse50 (store .cse52 .cse7 0))) (store (store |c_#memory_$Pointer$#1.offset| .cse3 .cse50) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| (store (store (select (store .cse51 .cse3 .cse50) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 4 v_prenex_6) 0 (select .cse52 .cse7)))))) .cse8) .cse9) (select (select (store .cse23 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| (store (store (select (store .cse53 .cse3 .cse24) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 4 v_ArrVal_1751) 0 .cse25)) .cse8) .cse9)) (= (select (select (let ((.cse58 (select .cse53 .cse3))) (let ((.cse56 (select .cse58 .cse7))) (let ((.cse54 (let ((.cse57 (store .cse58 .cse7 0))) (store (store |c_#memory_$Pointer$#1.offset| .cse3 .cse57) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| (store (store (select (store .cse53 .cse3 .cse57) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 4 v_ArrVal_1751) 0 .cse56)))) (.cse55 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1762) .cse3) .cse7))) (store .cse54 .cse55 (store (select .cse54 .cse55) (+ 4 .cse56) 0))))) .cse8) .cse9) 0) (forall ((v_ArrVal_1752 (Array Int Int)) (v_ArrVal_1749 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse15 .cse7 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1752) .cse16 v_ArrVal_1749) .cse8) .cse9) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|))))))) (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 0)) (forall ((v_ArrVal_1752 (Array Int Int)) (v_ArrVal_1749 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse15 .cse7 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1752) .cse16 v_ArrVal_1749) .cse8) .cse9) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 0)))) (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| Int)) (or (forall ((v_prenex_6 Int) (v_ArrVal_1763 (Array Int Int)) (v_ArrVal_1762 (Array Int Int)) (v_ArrVal_1751 Int) (v_prenex_5 (Array Int Int))) (let ((.cse62 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1763))) (or (= (select (select (let ((.cse60 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_prenex_5))) (let ((.cse61 (select .cse60 .cse3))) (let ((.cse59 (store .cse61 .cse7 0))) (store (store |c_#memory_$Pointer$#1.offset| .cse3 .cse59) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| (store (store (select (store .cse60 .cse3 .cse59) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 4 v_prenex_6) 0 (select .cse61 .cse7)))))) .cse8) .cse9) (select (select (store .cse23 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| (store (store (select (store .cse62 .cse3 .cse24) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 4 v_ArrVal_1751) 0 .cse25)) .cse8) .cse9)) (forall ((v_ArrVal_1752 (Array Int Int)) (v_ArrVal_1749 (Array Int Int))) (not (= .cse3 (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse15 .cse7 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1752) .cse16 v_ArrVal_1749) .cse8) .cse9)))) (= (select (select (let ((.cse67 (select .cse62 .cse3))) (let ((.cse65 (select .cse67 .cse7))) (let ((.cse63 (let ((.cse66 (store .cse67 .cse7 0))) (store (store |c_#memory_$Pointer$#1.offset| .cse3 .cse66) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| (store (store (select (store .cse62 .cse3 .cse66) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 4 v_ArrVal_1751) 0 .cse65)))) (.cse64 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1762) .cse3) .cse7))) (store .cse63 .cse64 (store (select .cse63 .cse64) (+ 4 .cse65) 0))))) .cse8) .cse9) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 0)))) (not (= (select |c_#valid| .cse3) 0)) (forall ((v_prenex_6 Int) (v_ArrVal_1762 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| Int) (v_prenex_5 (Array Int Int))) (or (= (select (select (let ((.cse72 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_prenex_5))) (let ((.cse73 (select .cse72 .cse3))) (let ((.cse70 (select .cse73 .cse7))) (let ((.cse68 (let ((.cse71 (store .cse73 .cse7 0))) (store (store |c_#memory_$Pointer$#1.offset| .cse3 .cse71) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| (store (store (select (store .cse72 .cse3 .cse71) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 4 v_prenex_6) 0 .cse70)))) (.cse69 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1762) .cse3) .cse7))) (store .cse68 .cse69 (store (select .cse68 .cse69) (+ .cse70 4) 0)))))) .cse8) .cse9) 0) (forall ((v_ArrVal_1752 (Array Int Int)) (v_ArrVal_1749 (Array Int Int))) (let ((.cse74 (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse15 .cse7 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1752) .cse16 v_ArrVal_1749) .cse8) .cse9))) (or (= .cse16 .cse74) (not (= .cse74 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 0)) (forall ((v_ArrVal_1763 (Array Int Int)) (v_ArrVal_1751 Int)) (= 0 (select (select (store .cse23 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| (store (store (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1763) .cse3 .cse24) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 4 v_ArrVal_1751) 0 .cse25)) .cse8) .cse9))))) (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 0)) (forall ((v_ArrVal_1752 (Array Int Int)) (v_ArrVal_1749 (Array Int Int))) (let ((.cse75 (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse15 .cse7 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1752) .cse16 v_ArrVal_1749) .cse8) .cse9))) (or (= .cse16 .cse75) (= .cse75 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|)))))) (forall ((v_ArrVal_1752 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| Int) (v_ArrVal_1749 (Array Int Int))) (or (forall ((v_prenex_6 Int) (v_ArrVal_1762 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse80 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_prenex_5))) (or (= (select (select (let ((.cse81 (select .cse80 .cse3))) (let ((.cse78 (select .cse81 .cse7))) (let ((.cse76 (let ((.cse79 (store .cse81 .cse7 0))) (store (store |c_#memory_$Pointer$#1.offset| .cse3 .cse79) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| (store (store (select (store .cse80 .cse3 .cse79) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 4 v_prenex_6) 0 .cse78)))) (.cse77 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1762) .cse3) .cse7))) (store .cse76 .cse77 (store (select .cse76 .cse77) (+ .cse78 4) 0))))) .cse8) .cse9) 0) (forall ((v_ArrVal_1763 (Array Int Int)) (v_ArrVal_1751 Int)) (let ((.cse82 (select (select (store .cse23 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| (store (store (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1763) .cse3 .cse24) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 4 v_ArrVal_1751) 0 .cse25)) .cse8) .cse9))) (or (= (select (select (store .cse23 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| (store (store (select (store .cse80 .cse3 .cse24) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 4 v_prenex_6) 0 .cse25)) .cse8) .cse9) .cse82) (= 0 .cse82))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 0)) (not (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse15 .cse7 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1752) .cse16 v_ArrVal_1749) .cse8) .cse9) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|)))) (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| Int)) (or (forall ((v_prenex_6 Int) (v_ArrVal_1763 (Array Int Int)) (v_ArrVal_1762 (Array Int Int)) (v_ArrVal_1751 Int) (v_prenex_5 (Array Int Int))) (let ((.cse87 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_prenex_5)) (.cse89 (select (select (store .cse23 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| (store (store (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1763) .cse3 .cse24) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 4 v_ArrVal_1751) 0 .cse25)) .cse8) .cse9))) (or (= (select (select (let ((.cse88 (select .cse87 .cse3))) (let ((.cse85 (select .cse88 .cse7))) (let ((.cse83 (let ((.cse86 (store .cse88 .cse7 0))) (store (store |c_#memory_$Pointer$#1.offset| .cse3 .cse86) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| (store (store (select (store .cse87 .cse3 .cse86) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 4 v_prenex_6) 0 .cse85)))) (.cse84 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1762) .cse3) .cse7))) (store .cse83 .cse84 (store (select .cse83 .cse84) (+ .cse85 4) 0))))) .cse8) .cse9) 0) (= (select (select (store .cse23 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| (store (store (select (store .cse87 .cse3 .cse24) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 4 v_prenex_6) 0 .cse25)) .cse8) .cse9) .cse89) (= 0 .cse89)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 0)) (forall ((v_ArrVal_1752 (Array Int Int)) (v_ArrVal_1749 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse15 .cse7 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1752) .cse16 v_ArrVal_1749) .cse8) .cse9) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|)))) (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|) 0)) (forall ((v_ArrVal_1752 (Array Int Int)) (v_ArrVal_1749 (Array Int Int))) (not (= .cse16 (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse15 .cse7 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1752) .cse16 v_ArrVal_1749) .cse8) .cse9))))))))))) is different from true [2024-11-09 22:08:03,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433962860] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:08:03,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:08:03,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 45 [2024-11-09 22:08:03,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475136428] [2024-11-09 22:08:03,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:08:03,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-09 22:08:03,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:08:03,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-09 22:08:03,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=981, Unknown=34, NotChecked=1520, Total=2652 [2024-11-09 22:08:03,092 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 45 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 36 states have internal predecessors, (69), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 22:08:03,330 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) is different from false [2024-11-09 22:08:03,332 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) is different from true [2024-11-09 22:08:03,334 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) is different from false [2024-11-09 22:08:03,336 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) is different from true [2024-11-09 22:08:03,341 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2)) (.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 .cse1) .cse0 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) .cse1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))))) is different from false [2024-11-09 22:08:03,342 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2)) (.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 .cse1) .cse0 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) .cse1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))))) is different from true [2024-11-09 22:08:03,346 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse1 (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not .cse1) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) is different from false [2024-11-09 22:08:03,348 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse1 (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not .cse1) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) is different from true [2024-11-09 22:08:03,354 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| (select .cse2 0)) 1)))))) is different from false [2024-11-09 22:08:03,355 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| (select .cse2 0)) 1)))))) is different from true [2024-11-09 22:08:03,376 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (.cse2 (select .cse1 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= .cse0 (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_14| (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (= (select |c_#valid| .cse4) 1)))) is different from false [2024-11-09 22:08:03,378 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (.cse2 (select .cse1 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= .cse0 (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_14| (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (= (select |c_#valid| .cse4) 1)))) is different from true [2024-11-09 22:08:03,391 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_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_33 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_33) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0))))) is different from false [2024-11-09 22:08:03,392 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_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_33 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_33) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0))))) is different from true [2024-11-09 22:08:03,399 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_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_33 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_33) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0))))) is different from false [2024-11-09 22:08:03,402 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_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_33 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_33) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0))))) is different from true [2024-11-09 22:08:03,414 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (or (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 8)) (= |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)))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_33 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_33) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0)))))) is different from false [2024-11-09 22:08:03,417 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (or (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 8)) (= |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)))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_33 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_33) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0)))))) is different from true [2024-11-09 22:08:03,427 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (.cse5 (select .cse4 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_33 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_33) 1)))) (not (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse5) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse6 (select |v_old(#valid)_AFTER_CALL_15| .cse6))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| (select (select |c_#memory_$Pointer$#1.base| .cse5) 0)) 1))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse3 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 0) 0) (= .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0)))) is different from false [2024-11-09 22:08:03,430 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (.cse5 (select .cse4 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_33 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_33) 1)))) (not (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse5) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse6 (select |v_old(#valid)_AFTER_CALL_15| .cse6))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| (select (select |c_#memory_$Pointer$#1.base| .cse5) 0)) 1))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse3 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 0) 0) (= .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0)))) is different from true [2024-11-09 22:08:03,461 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse5 0)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (and (= (select .cse0 0) 0) (or (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_33 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse2) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_33) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_14| (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (= .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse6))))) is different from false [2024-11-09 22:08:03,465 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse5 0)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (and (= (select .cse0 0) 0) (or (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_33 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse2) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_33) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_14| (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (= .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse6))))) is different from true [2024-11-09 22:08:03,480 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse4 0)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select .cse0 0) 0) (or (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)) (= .cse1 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_33 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse2) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_33) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse5 (select |v_old(#valid)_AFTER_CALL_15| .cse5))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_14| (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8))))) is different from false [2024-11-09 22:08:03,483 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse4 0)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select .cse0 0) 0) (or (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)) (= .cse1 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_33 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse2) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_33) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse5 (select |v_old(#valid)_AFTER_CALL_15| .cse5))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_14| (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8))))) is different from true [2024-11-09 22:08:03,501 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse8 0)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse6) 0))) (and (= (select .cse0 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_33 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_33) 1)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse5) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse6 .cse5)) (exists ((v_arrayElimCell_39 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse6) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse7 (select |v_old(#valid)_AFTER_CALL_15| .cse7))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_39) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_39) 4) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2)) 8)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 0) 0))))) is different from false [2024-11-09 22:08:03,504 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse8 0)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse6) 0))) (and (= (select .cse0 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_33 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_33) 1)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse5) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse6 .cse5)) (exists ((v_arrayElimCell_39 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse6) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse7 (select |v_old(#valid)_AFTER_CALL_15| .cse7))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_39) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_39) 4) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2)) 8)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 0) 0))))) is different from true [2024-11-09 22:08:03,566 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (let ((.cse1 (select .cse0 0)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) 8)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select .cse2 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse1) 8)) (exists ((v_arrayElimCell_39 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |v_old(#valid)_AFTER_CALL_15| .cse3))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_39) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_39) 4) 0))) (or (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_33 Int)) (and (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_33) 1))))) (= 0 (select .cse2 |c_ULTIMATE.start_main_~ptr~0#1.offset|))))) is different from false [2024-11-09 22:08:03,570 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (let ((.cse1 (select .cse0 0)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) 8)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select .cse2 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse1) 8)) (exists ((v_arrayElimCell_39 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |v_old(#valid)_AFTER_CALL_15| .cse3))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_39) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_39) 4) 0))) (or (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_33 Int)) (and (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_33) 1))))) (= 0 (select .cse2 |c_ULTIMATE.start_main_~ptr~0#1.offset|))))) is different from true [2024-11-09 22:08:03,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:08:03,668 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2024-11-09 22:08:03,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 22:08:03,669 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 36 states have internal predecessors, (69), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2024-11-09 22:08:03,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:08:03,670 INFO L225 Difference]: With dead ends: 93 [2024-11-09 22:08:03,670 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 22:08:03,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 33 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=157, Invalid=1103, Unknown=62, NotChecked=3234, Total=4556 [2024-11-09 22:08:03,671 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 2279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1848 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 22:08:03,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 671 Invalid, 2279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 425 Invalid, 0 Unknown, 1848 Unchecked, 0.4s Time] [2024-11-09 22:08:03,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 22:08:03,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-09 22:08:03,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.1265822784810127) internal successors, (89), 79 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 22:08:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2024-11-09 22:08:03,680 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 44 [2024-11-09 22:08:03,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:08:03,680 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2024-11-09 22:08:03,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 36 states have internal predecessors, (69), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 22:08:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2024-11-09 22:08:03,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 22:08:03,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:08:03,681 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:08:03,698 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-09 22:08:03,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:08:03,881 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:08:03,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:08:03,882 INFO L85 PathProgramCache]: Analyzing trace with hash 2043087135, now seen corresponding path program 1 times [2024-11-09 22:08:03,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:08:03,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246334569] [2024-11-09 22:08:03,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:08:03,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:08:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:04,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:08:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:04,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:08:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:04,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:08:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:04,110 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 22:08:04,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:08:04,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246334569] [2024-11-09 22:08:04,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246334569] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:08:04,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378368070] [2024-11-09 22:08:04,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:08:04,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:08:04,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:08:04,113 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-09 22:08:04,113 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-09 22:08:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:04,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 22:08:04,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:08:04,328 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 22:08:04,328 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:08:04,398 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 22:08:04,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378368070] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:08:04,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:08:04,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2024-11-09 22:08:04,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394275674] [2024-11-09 22:08:04,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:08:04,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 22:08:04,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:08:04,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 22:08:04,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-09 22:08:04,402 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-09 22:08:04,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:08:04,536 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2024-11-09 22:08:04,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 22:08:04,537 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 44 [2024-11-09 22:08:04,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:08:04,537 INFO L225 Difference]: With dead ends: 108 [2024-11-09 22:08:04,537 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 22:08:04,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-11-09 22:08:04,538 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 36 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:08:04,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 302 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:08:04,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 22:08:04,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2024-11-09 22:08:04,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.1012658227848102) internal successors, (87), 79 states have internal predecessors, (87), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 22:08:04,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2024-11-09 22:08:04,554 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 44 [2024-11-09 22:08:04,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:08:04,555 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2024-11-09 22:08:04,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-09 22:08:04,555 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2024-11-09 22:08:04,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 22:08:04,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:08:04,558 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, 1] [2024-11-09 22:08:04,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 22:08:04,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:08:04,759 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:08:04,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:08:04,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2072937405, now seen corresponding path program 1 times [2024-11-09 22:08:04,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:08:04,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278803215] [2024-11-09 22:08:04,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:08:04,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:08:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:04,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:08:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:04,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:08:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:04,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:08:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 22:08:04,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:08:04,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278803215] [2024-11-09 22:08:04,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278803215] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:08:04,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374580127] [2024-11-09 22:08:04,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:08:04,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:08:04,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:08:04,850 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:08:04,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 22:08:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:05,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 22:08:05,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:08:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 22:08:05,050 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:08:05,074 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 22:08:05,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374580127] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:08:05,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:08:05,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-11-09 22:08:05,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110272274] [2024-11-09 22:08:05,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:08:05,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 22:08:05,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:08:05,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 22:08:05,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:08:05,075 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 22:08:05,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:08:05,131 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2024-11-09 22:08:05,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 22:08:05,132 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 44 [2024-11-09 22:08:05,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:08:05,132 INFO L225 Difference]: With dead ends: 128 [2024-11-09 22:08:05,132 INFO L226 Difference]: Without dead ends: 70 [2024-11-09 22:08:05,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:08:05,134 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:08:05,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:08:05,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-09 22:08:05,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-09 22:08:05,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.098360655737705) internal successors, (67), 61 states have internal predecessors, (67), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 22:08:05,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2024-11-09 22:08:05,142 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 44 [2024-11-09 22:08:05,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:08:05,142 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2024-11-09 22:08:05,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 22:08:05,143 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2024-11-09 22:08:05,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 22:08:05,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:08:05,143 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, 1, 1, 1] [2024-11-09 22:08:05,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 22:08:05,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:08:05,344 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:08:05,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:08:05,344 INFO L85 PathProgramCache]: Analyzing trace with hash -514659235, now seen corresponding path program 1 times [2024-11-09 22:08:05,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:08:05,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639664921] [2024-11-09 22:08:05,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:08:05,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:08:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:06,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:08:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:06,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:08:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:06,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:08:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:07,111 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-09 22:08:07,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:08:07,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639664921] [2024-11-09 22:08:07,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639664921] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:08:07,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973897860] [2024-11-09 22:08:07,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:08:07,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:08:07,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:08:07,113 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:08:07,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 22:08:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:07,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 193 conjuncts are in the unsatisfiable core [2024-11-09 22:08:07,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:08:07,405 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-09 22:08:07,413 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-09 22:08:11,633 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse0 (select |c_#memory_int#1| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from false [2024-11-09 22:08:11,637 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse0 (select |c_#memory_int#1| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from true [2024-11-09 22:08:11,658 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-09 22:08:11,662 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-09 22:08:11,675 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 22:08:11,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 22:08:11,692 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from false [2024-11-09 22:08:11,694 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from true [2024-11-09 22:08:11,717 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 22:08:11,717 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 95 treesize of output 80 [2024-11-09 22:08:11,732 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-09 22:08:11,733 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-09 22:08:11,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2024-11-09 22:08:11,757 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) .cse2) (or (= (select (select |c_#memory_int#1| .cse0) 8) 1) .cse2)))) is different from false [2024-11-09 22:08:11,759 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) .cse2) (or (= (select (select |c_#memory_int#1| .cse0) 8) 1) .cse2)))) is different from true [2024-11-09 22:08:11,788 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (let ((.cse1 (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (or (= (select (select |c_#memory_int#1| .cse0) 8) 1) .cse1) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 1))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) .cse1)))) is different from false [2024-11-09 22:08:11,790 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (let ((.cse1 (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (or (= (select (select |c_#memory_int#1| .cse0) 8) 1) .cse1) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 1))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) .cse1)))) is different from true [2024-11-09 22:08:11,878 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 22:08:11,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 91 [2024-11-09 22:08:11,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2024-11-09 22:08:11,895 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 22:08:11,895 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 28 treesize of output 31 [2024-11-09 22:08:11,908 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-09 22:08:11,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 38 [2024-11-09 22:08:11,926 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (let ((.cse0 (= .cse1 |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (and (or .cse0 (= (select (select |c_#memory_int#1| .cse1) 8) 1)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) 0) .cse0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)))) is different from false [2024-11-09 22:08:11,928 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (let ((.cse0 (= .cse1 |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (and (or .cse0 (= (select (select |c_#memory_int#1| .cse1) 8) 1)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) 0) .cse0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)))) is different from true [2024-11-09 22:08:11,967 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_24| .cse2) 0))) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (or (= .cse2 .cse0) (= (select (select |c_#memory_int#1| .cse0) 8) 1))))) is different from false [2024-11-09 22:08:11,969 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_24| .cse2) 0))) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (or (= .cse2 .cse0) (= (select (select |c_#memory_int#1| .cse0) 8) 1))))) is different from true [2024-11-09 22:08:11,983 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 22:08:11,983 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 79 treesize of output 38 [2024-11-09 22:08:11,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:08:11,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:08:11,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-09 22:08:12,007 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)|) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-09 22:08:12,009 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)|) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-09 22:08:12,032 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-09 22:08:12,034 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-09 22:08:12,080 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 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-09 22:08:12,082 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 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-09 22:08:12,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:08:12,133 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-09 22:08:12,134 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 87 treesize of output 64 [2024-11-09 22:08:12,172 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2024-11-09 22:08:12,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 73 [2024-11-09 22:08:12,215 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-09 22:08:12,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 47 [2024-11-09 22:08:12,257 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0))) (let ((.cse5 (= .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (.cse0 (= .cse4 .cse6))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse6))) (let ((.cse1 (or .cse5 (= (select .cse3 0) 0)))) (or (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| .cse4))) (and (or (and (not .cse0) .cse1) (= .cse2 .cse3)) (= (select .cse2 0) 0))) (and (= .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1)))) (or .cse5 .cse0 (= (select (select |c_#memory_int#1| .cse6) 8) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse4) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse7 (select |v_old(#valid)_AFTER_CALL_25| .cse7))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_24| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse4) 0))) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse4 (select (select |c_#memory_$Pointer$#1.base| .cse6) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse8) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse9 (select |v_#valid_BEFORE_CALL_11| .cse9))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1)))))))) is different from false [2024-11-09 22:08:12,259 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0))) (let ((.cse5 (= .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (.cse0 (= .cse4 .cse6))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse6))) (let ((.cse1 (or .cse5 (= (select .cse3 0) 0)))) (or (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| .cse4))) (and (or (and (not .cse0) .cse1) (= .cse2 .cse3)) (= (select .cse2 0) 0))) (and (= .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1)))) (or .cse5 .cse0 (= (select (select |c_#memory_int#1| .cse6) 8) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse4) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse7 (select |v_old(#valid)_AFTER_CALL_25| .cse7))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_24| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse4) 0))) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse4 (select (select |c_#memory_$Pointer$#1.base| .cse6) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse8) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse9 (select |v_#valid_BEFORE_CALL_11| .cse9))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1)))))))) is different from true [2024-11-09 22:08:12,376 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (let ((.cse1 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse5))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse5))) (let ((.cse2 (= (select .cse4 0) 0))) (or (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse0) (or .cse1 .cse2)) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse0))) (and (= (select .cse3 0) 0) (or .cse1 .cse2 (= .cse3 .cse4))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse5) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse6 (select |v_old(#valid)_AFTER_CALL_25| .cse6))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0))) (or .cse1 (= .cse0 .cse5) (= (select (select |c_#memory_int#1| .cse5) 8) 1)) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse7) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse8 (select |v_#valid_BEFORE_CALL_11| .cse8))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1)))))))) is different from false [2024-11-09 22:08:12,379 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (let ((.cse1 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse5))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse5))) (let ((.cse2 (= (select .cse4 0) 0))) (or (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse0) (or .cse1 .cse2)) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse0))) (and (= (select .cse3 0) 0) (or .cse1 .cse2 (= .cse3 .cse4))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse5) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse6 (select |v_old(#valid)_AFTER_CALL_25| .cse6))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0))) (or .cse1 (= .cse0 .cse5) (= (select (select |c_#memory_int#1| .cse5) 8) 1)) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse7) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse8 (select |v_#valid_BEFORE_CALL_11| .cse8))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1)))))))) is different from true [2024-11-09 22:08:12,471 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (let ((.cse3 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse1))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_old(#valid)_AFTER_CALL_25| .cse2))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0))) (or .cse3 (= .cse0 .cse1) (= (select (select |c_#memory_int#1| .cse1) 8) 1)) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1)))) (let ((.cse6 (or .cse3 (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)))) (or (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse0) .cse6) (and (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) .cse6))))))) is different from false [2024-11-09 22:08:12,474 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (let ((.cse3 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse1))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_old(#valid)_AFTER_CALL_25| .cse2))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0))) (or .cse3 (= .cse0 .cse1) (= (select (select |c_#memory_int#1| .cse1) 8) 1)) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1)))) (let ((.cse6 (or .cse3 (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)))) (or (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse0) .cse6) (and (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) .cse6))))))) is different from true [2024-11-09 22:08:12,563 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0)) (.cse4 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse1))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse2) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_old(#valid)_AFTER_CALL_25| .cse3))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (or .cse4 (= .cse0 .cse1) (= (select (select |c_#memory_int#1| .cse1) 8) 1)) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse5) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1)))) (let ((.cse7 (or .cse4 (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)))) (or (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse0) .cse7) (and (= .cse2 0) .cse7))))))) is different from false [2024-11-09 22:08:12,566 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0)) (.cse4 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse1))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse2) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_old(#valid)_AFTER_CALL_25| .cse3))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (or .cse4 (= .cse0 .cse1) (= (select (select |c_#memory_int#1| .cse1) 8) 1)) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse5) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1)))) (let ((.cse7 (or .cse4 (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)))) (or (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse0) .cse7) (and (= .cse2 0) .cse7))))))) is different from true [2024-11-09 22:08:12,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:08:12,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:08:12,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:08:12,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:08:12,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:08:12,804 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 128 treesize of output 111 [2024-11-09 22:08:12,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:08:12,872 INFO L349 Elim1Store]: treesize reduction 369, result has 10.2 percent of original size [2024-11-09 22:08:12,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 655 treesize of output 389 [2024-11-09 22:08:12,924 INFO L349 Elim1Store]: treesize reduction 461, result has 14.3 percent of original size [2024-11-09 22:08:12,924 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 6 case distinctions, treesize of input 386 treesize of output 243 [2024-11-09 22:08:12,949 INFO L349 Elim1Store]: treesize reduction 67, result has 34.3 percent of original size [2024-11-09 22:08:12,949 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 1 case distinctions, treesize of input 113 treesize of output 82 [2024-11-09 22:08:12,997 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse3 (select .cse4 0))) (let ((.cse5 (= .cse0 .cse2)) (.cse7 (select |c_#memory_$Pointer$#1.offset| .cse3)) (.cse8 (select .cse6 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_old(#valid)_AFTER_CALL_25| .cse1))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0))) (= .cse0 (select .cse4 4)) (or (= (select (select |c_#memory_int#1| .cse3) 8) 1) (= .cse2 .cse3)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) .cse5) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse6 4) 0) (or .cse5 (and (= (select .cse7 0) 0) (= .cse8 0))) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse9) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse10 (select |v_#valid_BEFORE_CALL_11| .cse10))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1)))) (= (select .cse7 (+ .cse8 4)) 0) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)))))))) is different from false [2024-11-09 22:08:12,999 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse3 (select .cse4 0))) (let ((.cse5 (= .cse0 .cse2)) (.cse7 (select |c_#memory_$Pointer$#1.offset| .cse3)) (.cse8 (select .cse6 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_old(#valid)_AFTER_CALL_25| .cse1))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0))) (= .cse0 (select .cse4 4)) (or (= (select (select |c_#memory_int#1| .cse3) 8) 1) (= .cse2 .cse3)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) .cse5) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse6 4) 0) (or .cse5 (and (= (select .cse7 0) 0) (= .cse8 0))) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse9) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse10 (select |v_#valid_BEFORE_CALL_11| .cse10))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1)))) (= (select .cse7 (+ .cse8 4)) 0) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)))))))) is different from true [2024-11-09 22:08:13,078 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse3 (select .cse4 0))) (let ((.cse5 (= .cse0 .cse2)) (.cse7 (select |c_#memory_$Pointer$#1.offset| .cse3)) (.cse8 (select .cse6 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_old(#valid)_AFTER_CALL_25| .cse1))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0))) (= .cse0 (select .cse4 4)) (or (= (select (select |c_#memory_int#1| .cse3) 8) 1) (= .cse2 .cse3)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) .cse5) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse6 4) 0) (or .cse5 (and (= (select .cse7 0) 0) (= .cse8 0))) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse9) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse10 (select |v_#valid_BEFORE_CALL_11| .cse10))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1)))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select .cse7 (+ .cse8 4)) 0) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)))))))) is different from false [2024-11-09 22:08:13,082 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse3 (select .cse4 0))) (let ((.cse5 (= .cse0 .cse2)) (.cse7 (select |c_#memory_$Pointer$#1.offset| .cse3)) (.cse8 (select .cse6 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_old(#valid)_AFTER_CALL_25| .cse1))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0))) (= .cse0 (select .cse4 4)) (or (= (select (select |c_#memory_int#1| .cse3) 8) 1) (= .cse2 .cse3)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) .cse5) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse6 4) 0) (or .cse5 (and (= (select .cse7 0) 0) (= .cse8 0))) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse9) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse10 (select |v_#valid_BEFORE_CALL_11| .cse10))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1)))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select .cse7 (+ .cse8 4)) 0) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)))))))) is different from true [2024-11-09 22:08:13,183 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse3 (select .cse4 0))) (let ((.cse5 (= .cse0 .cse2)) (.cse7 (select |c_#memory_$Pointer$#1.offset| .cse3)) (.cse8 (select .cse6 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) |c_ULTIMATE.start_main_#t~mem20#1|) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_old(#valid)_AFTER_CALL_25| .cse1))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0))) (= .cse0 (select .cse4 4)) (or (= (select (select |c_#memory_int#1| .cse3) 8) 1) (= .cse2 .cse3)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) .cse5) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse6 4) 0) (or .cse5 (and (= (select .cse7 0) 0) (= .cse8 0))) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse9) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse10 (select |v_#valid_BEFORE_CALL_11| .cse10))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1)))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select .cse7 (+ .cse8 4)) 0) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)))))))) is different from false [2024-11-09 22:08:13,186 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse3 (select .cse4 0))) (let ((.cse5 (= .cse0 .cse2)) (.cse7 (select |c_#memory_$Pointer$#1.offset| .cse3)) (.cse8 (select .cse6 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) |c_ULTIMATE.start_main_#t~mem20#1|) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_old(#valid)_AFTER_CALL_25| .cse1))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0))) (= .cse0 (select .cse4 4)) (or (= (select (select |c_#memory_int#1| .cse3) 8) 1) (= .cse2 .cse3)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) .cse5) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse6 4) 0) (or .cse5 (and (= (select .cse7 0) 0) (= .cse8 0))) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse9) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse10 (select |v_#valid_BEFORE_CALL_11| .cse10))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1)))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select .cse7 (+ .cse8 4)) 0) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)))))))) is different from true [2024-11-09 22:08:13,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:08:13,227 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 311 treesize of output 215 [2024-11-09 22:08:13,237 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 22:08:13,237 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-09 22:08:13,363 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_96 Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_96) 0))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse2 (select .cse5 0))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and (= 0 (select .cse0 4)) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 0) v_arrayElimCell_96) (= (select (select |c_#memory_int#1| v_arrayElimCell_96) 8) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_old(#valid)_AFTER_CALL_25| .cse3))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_96) 1) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_96) 0) 0) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select .cse0 0) 0) (= (select (select |c_#memory_int#1| .cse2) 8) 1) (= (select .cse4 4) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse2) 1) (= (select .cse5 4) v_arrayElimCell_96) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_96) 0))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2024-11-09 22:08:13,367 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_96 Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_96) 0))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse2 (select .cse5 0))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and (= 0 (select .cse0 4)) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 0) v_arrayElimCell_96) (= (select (select |c_#memory_int#1| v_arrayElimCell_96) 8) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_old(#valid)_AFTER_CALL_25| .cse3))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_96) 1) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_96) 0) 0) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select .cse0 0) 0) (= (select (select |c_#memory_int#1| .cse2) 8) 1) (= (select .cse4 4) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse2) 1) (= (select .cse5 4) v_arrayElimCell_96) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_96) 0))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2024-11-09 22:08:13,477 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_96 Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_96) 0))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse2 (select .cse5 0))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and (= 0 (select .cse0 4)) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 0) v_arrayElimCell_96) (= (select (select |c_#memory_int#1| v_arrayElimCell_96) 8) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_old(#valid)_AFTER_CALL_25| .cse3))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_96) 1) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_96) 0) 0) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select .cse0 0) 0) (= (select (select |c_#memory_int#1| .cse2) 8) 1) (= (select .cse4 4) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse2) 1) (= (select .cse5 4) v_arrayElimCell_96) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_96) 0))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (<= |c_ULTIMATE.start_main_#t~mem24#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2024-11-09 22:08:13,479 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_96 Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_96) 0))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse2 (select .cse5 0))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and (= 0 (select .cse0 4)) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 0) v_arrayElimCell_96) (= (select (select |c_#memory_int#1| v_arrayElimCell_96) 8) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_old(#valid)_AFTER_CALL_25| .cse3))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_96) 1) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_96) 0) 0) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select .cse0 0) 0) (= (select (select |c_#memory_int#1| .cse2) 8) 1) (= (select .cse4 4) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse2) 1) (= (select .cse5 4) v_arrayElimCell_96) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_96) 0))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (<= |c_ULTIMATE.start_main_#t~mem24#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2024-11-09 22:08:13,510 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-09 22:08:13,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 68 [2024-11-09 22:08:13,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:08:13,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:08:13,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:08:13,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2024-11-09 22:08:13,546 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((v_arrayElimIndex_10 Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (v_arrayElimCell_103 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_10) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_103) 0) (= (select (select |c_#memory_int#1| v_arrayElimCell_103) 8) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_old(#valid)_AFTER_CALL_25| .cse0))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_103) 1) (<= 5 (select (select |c_#memory_int#1| v_arrayElimIndex_10) 8)) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) 1)) is different from false [2024-11-09 22:08:13,548 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((v_arrayElimIndex_10 Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (v_arrayElimCell_103 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_10) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_103) 0) (= (select (select |c_#memory_int#1| v_arrayElimCell_103) 8) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_old(#valid)_AFTER_CALL_25| .cse0))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_103) 1) (<= 5 (select (select |c_#memory_int#1| v_arrayElimIndex_10) 8)) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) 1)) is different from true [2024-11-09 22:08:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2024-11-09 22:08:13,591 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:08:15,136 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2506 (Array Int Int)) (v_ArrVal_2526 (Array Int Int)) (v_ArrVal_2503 (Array Int Int)) (v_ArrVal_2524 (Array Int Int)) (v_ArrVal_2502 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_32| Int) (v_ArrVal_2513 Int)) (let ((.cse18 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_32| v_ArrVal_2526)) (.cse10 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_32| v_ArrVal_2524)) (.cse20 (select .cse18 .cse10)) (.cse15 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse19 (select .cse20 .cse15)) (.cse14 (select .cse13 .cse10))) (let ((.cse8 (select .cse14 .cse15)) (.cse9 (+ 4 .cse19))) (let ((.cse6 (let ((.cse16 (let ((.cse17 (store .cse20 .cse15 0))) (store (store |c_#memory_$Pointer$#1.offset| .cse10 .cse17) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_32| (store (store (select (store .cse18 .cse10 .cse17) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_32|) 4 .cse15) 0 .cse19))))) (store .cse16 .cse8 (store (select .cse16 .cse8) .cse9 0)))) (.cse5 (let ((.cse11 (let ((.cse12 (store .cse14 .cse15 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_32|))) (store (store |c_#memory_$Pointer$#1.base| .cse10 .cse12) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_32| (store (store (select (store .cse13 .cse10 .cse12) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_32|) 4 .cse10) 0 .cse8))))) (store .cse11 .cse8 (store (select .cse11 .cse8) .cse9 v_ArrVal_2513)))) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (store (store |c_#memory_int#1| .cse10 v_ArrVal_2506) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_32| v_ArrVal_2502))) (let ((.cse0 (store .cse7 .cse8 v_ArrVal_2503)) (.cse1 (select (select .cse5 .cse3) .cse4)) (.cse2 (select (select .cse6 .cse3) .cse4))) (or (< (select (select .cse0 .cse1) (+ 8 .cse2)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 .cse3) (+ 8 .cse4)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_32|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 (select (select .cse5 .cse1) .cse2)) (+ (select (select .cse6 .cse1) .cse2) 8))) (not (= (store (select .cse7 .cse8) .cse9 (select v_ArrVal_2503 .cse9)) v_ArrVal_2503)))))))))) is different from false [2024-11-09 22:08:15,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973897860] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:08:15,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:08:15,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30] total 50 [2024-11-09 22:08:15,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321863659] [2024-11-09 22:08:15,151 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:08:15,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 22:08:15,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:08:15,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 22:08:15,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1464, Unknown=43, NotChecked=1900, Total=3540 [2024-11-09 22:08:15,153 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand has 50 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 41 states have internal predecessors, (71), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 22:08:15,571 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) (let ((.cse1 (= .cse2 1))) (and (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse0 (select |c_#memory_int#1| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)))) .cse1) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 8)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) .cse1 (= |c_ULTIMATE.start_dll_circular_create_~data#1| 1)))) is different from false [2024-11-09 22:08:15,574 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) (let ((.cse1 (= .cse2 1))) (and (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse0 (select |c_#memory_int#1| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)))) .cse1) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 8)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) .cse1 (= |c_ULTIMATE.start_dll_circular_create_~data#1| 1)))) is different from true [2024-11-09 22:08:15,577 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (.cse0 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8)) (.cse3 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse3 (= .cse0 1)) (not .cse3) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 8)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) is different from false [2024-11-09 22:08:15,578 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (.cse0 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8)) (.cse3 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse3 (= .cse0 1)) (not .cse3) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 8)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) is different from true [2024-11-09 22:08:15,580 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0)) (.cse3 (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not .cse3) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 8)) (or .cse0 .cse3) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (or (= (select (select |c_#memory_int#1| .cse1) 8) 1) .cse3) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 8))))) is different from false [2024-11-09 22:08:15,582 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0)) (.cse3 (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not .cse3) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 8)) (or .cse0 .cse3) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (or (= (select (select |c_#memory_int#1| .cse1) 8) 1) .cse3) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 8))))) is different from true [2024-11-09 22:08:15,585 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse2 (select .cse0 0))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse3 (= .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (or (= (select (select |c_#memory_int#1| .cse2) 8) 1) .cse3) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_24| .cse2) 1))) (= .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 8)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (or (= (select .cse1 0) 0) .cse3) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 8)))))) is different from false [2024-11-09 22:08:15,586 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse2 (select .cse0 0))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse3 (= .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (or (= (select (select |c_#memory_int#1| .cse2) 8) 1) .cse3) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_24| .cse2) 1))) (= .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 8)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (or (= (select .cse1 0) 0) .cse3) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 8)))))) is different from true [2024-11-09 22:08:15,593 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse1 (select .cse5 0))) (let ((.cse0 (= .cse1 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (.cse2 (select .cse5 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (and (or .cse0 (= (select (select |c_#memory_int#1| .cse1) 8) 1)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse2) 8)) (not (= .cse2 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (or (= (select .cse3 0) 0) .cse0) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select .cse3 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 0))))) is different from false [2024-11-09 22:08:15,595 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse1 (select .cse5 0))) (let ((.cse0 (= .cse1 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (.cse2 (select .cse5 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (and (or .cse0 (= (select (select |c_#memory_int#1| .cse1) 8) 1)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse2) 8)) (not (= .cse2 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (or (= (select .cse3 0) 0) .cse0) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select .cse3 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 0))))) is different from true [2024-11-09 22:08:15,599 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse4 0)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse6)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_24| .cse2) 0))) (not (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse3) 1) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse3) 8)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse6)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (or (= .cse2 .cse0) (= (select (select |c_#memory_int#1| .cse0) 8) 1)) (= (select |c_#valid| .cse5) 1))))) is different from false [2024-11-09 22:08:15,601 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse4 0)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse6)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_24| .cse2) 0))) (not (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse3) 1) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse3) 8)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse6)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (or (= .cse2 .cse0) (= (select (select |c_#memory_int#1| .cse0) 8) 1)) (= (select |c_#valid| .cse5) 1))))) is different from true [2024-11-09 22:08:15,605 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)|) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= |c_old(#length)| |c_#length|)) is different from false [2024-11-09 22:08:15,607 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)|) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= |c_old(#length)| |c_#length|)) is different from true [2024-11-09 22:08:15,610 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-09 22:08:15,612 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-09 22:08:15,624 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|)) (.cse1 (select |c_#memory_int#1| |c_node_create_#res#1.base|)) (.cse2 (@diff |c_old(#memory_int#1)| |c_#memory_int#1|)) (.cse3 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|))) (and (or (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| .cse1)) (= |c_node_create_#in~data#1| (select .cse1 8)) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| .cse2 (select |c_#memory_int#1| .cse2))) (or (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= .cse2 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#res#1.base| .cse3)) (= |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_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse4) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_24| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1)))) (= |c_#valid| (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse6 (select |c_#valid| .cse6)))) (= |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|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse3 (select |c_#memory_$Pointer$#1.offset| .cse3))))) is different from false [2024-11-09 22:08:15,628 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|)) (.cse1 (select |c_#memory_int#1| |c_node_create_#res#1.base|)) (.cse2 (@diff |c_old(#memory_int#1)| |c_#memory_int#1|)) (.cse3 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|))) (and (or (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| .cse1)) (= |c_node_create_#in~data#1| (select .cse1 8)) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| .cse2 (select |c_#memory_int#1| .cse2))) (or (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= .cse2 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#res#1.base| .cse3)) (= |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_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse4) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_24| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1)))) (= |c_#valid| (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse6 (select |c_#valid| .cse6)))) (= |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|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse3 (select |c_#memory_$Pointer$#1.offset| .cse3))))) is different from true [2024-11-09 22:08:15,638 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse9 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse11 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| .cse5) 0))) (let ((.cse6 (= .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (.cse1 (= .cse5 .cse7)) (.cse8 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse11))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse7))) (let ((.cse2 (or .cse6 (= (select .cse4 0) 0)))) (or (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse5))) (and (or (and (not .cse1) .cse2) (= .cse3 .cse4)) (= (select .cse3 0) 0))) (and (= .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2)))) (not (= .cse8 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or .cse6 .cse1 (= (select (select |c_#memory_int#1| .cse7) 8) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse5) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse10 (select |v_old(#valid)_AFTER_CALL_25| .cse10))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_24| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse5) 0))) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse5 (select (select |c_#memory_$Pointer$#1.base| .cse7) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse8) 8)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse11)) (not (= .cse8 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse12) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse13 (select |v_#valid_BEFORE_CALL_11| .cse13))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse12) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1))))))))) is different from false [2024-11-09 22:08:15,641 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse9 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse11 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| .cse5) 0))) (let ((.cse6 (= .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (.cse1 (= .cse5 .cse7)) (.cse8 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse11))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse7))) (let ((.cse2 (or .cse6 (= (select .cse4 0) 0)))) (or (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse5))) (and (or (and (not .cse1) .cse2) (= .cse3 .cse4)) (= (select .cse3 0) 0))) (and (= .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2)))) (not (= .cse8 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or .cse6 .cse1 (= (select (select |c_#memory_int#1| .cse7) 8) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse5) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse10 (select |v_old(#valid)_AFTER_CALL_25| .cse10))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_24| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse5) 0))) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse5 (select (select |c_#memory_$Pointer$#1.base| .cse7) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse8) 8)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse11)) (not (= .cse8 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse12) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse13 (select |v_#valid_BEFORE_CALL_11| .cse13))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse12) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1))))))))) is different from true [2024-11-09 22:08:15,651 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse9 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (let ((.cse2 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse6)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (and (= (select .cse0 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) 0) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| .cse6))) (let ((.cse3 (= (select .cse5 0) 0))) (or (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse1) (or .cse2 .cse3)) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and (= (select .cse4 0) 0) (or .cse2 .cse3 (= .cse4 .cse5))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse1 (select (select |c_#memory_$Pointer$#1.base| .cse6) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse7 (select |v_old(#valid)_AFTER_CALL_25| .cse7))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 0))) (or .cse2 (= .cse1 .cse6) (= (select (select |c_#memory_int#1| .cse6) 8) 1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse8) 8)) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= .cse8 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (= .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse10) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse11 (select |v_#valid_BEFORE_CALL_11| .cse11))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1)))) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse8))))))) is different from false [2024-11-09 22:08:15,653 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse9 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (let ((.cse2 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse6)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (and (= (select .cse0 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) 0) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| .cse6))) (let ((.cse3 (= (select .cse5 0) 0))) (or (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse1) (or .cse2 .cse3)) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and (= (select .cse4 0) 0) (or .cse2 .cse3 (= .cse4 .cse5))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse1 (select (select |c_#memory_$Pointer$#1.base| .cse6) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse7 (select |v_old(#valid)_AFTER_CALL_25| .cse7))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 0))) (or .cse2 (= .cse1 .cse6) (= (select (select |c_#memory_int#1| .cse6) 8) 1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse8) 8)) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= .cse8 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (= .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse10) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse11 (select |v_#valid_BEFORE_CALL_11| .cse11))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1)))) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse8))))))) is different from true [2024-11-09 22:08:15,667 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse6 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse2)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (and (= (select .cse0 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_old(#valid)_AFTER_CALL_25| .cse3))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 0))) (or .cse4 (= .cse1 .cse2) (= (select (select |c_#memory_int#1| .cse2) 8) 1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse5) 8)) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= .cse5 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (= .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse7) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse8 (select |v_#valid_BEFORE_CALL_11| .cse8))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1)))) (let ((.cse9 (or .cse4 (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) (or (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse1) .cse9) (and (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) .cse9))) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse5))))))) is different from false [2024-11-09 22:08:15,671 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse6 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse2)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (and (= (select .cse0 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_old(#valid)_AFTER_CALL_25| .cse3))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 0))) (or .cse4 (= .cse1 .cse2) (= (select (select |c_#memory_int#1| .cse2) 8) 1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse5) 8)) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= .cse5 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (= .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse7) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse8 (select |v_#valid_BEFORE_CALL_11| .cse8))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1)))) (let ((.cse9 (or .cse4 (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) (or (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse1) .cse9) (and (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) .cse9))) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse5))))))) is different from true [2024-11-09 22:08:15,685 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse4 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0)) (.cse6 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse2))) (and (= (select .cse0 0) 0) (= .cse1 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse3) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse5 (select |v_old(#valid)_AFTER_CALL_25| .cse5))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 0))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (or .cse6 (= .cse1 .cse2) (= (select (select |c_#memory_int#1| .cse2) 8) 1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse7) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse8 (select |v_#valid_BEFORE_CALL_11| .cse8))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1)))) (let ((.cse9 (or .cse6 (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) (or (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse1) .cse9) (and (= .cse3 0) .cse9)))))))) is different from false [2024-11-09 22:08:15,689 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse4 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0)) (.cse6 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse2))) (and (= (select .cse0 0) 0) (= .cse1 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse3) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse5 (select |v_old(#valid)_AFTER_CALL_25| .cse5))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 0))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (or .cse6 (= .cse1 .cse2) (= (select (select |c_#memory_int#1| .cse2) 8) 1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse7) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse8 (select |v_#valid_BEFORE_CALL_11| .cse8))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1)))) (let ((.cse9 (or .cse6 (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) (or (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse1) .cse9) (and (= .cse3 0) .cse9)))))))) is different from true [2024-11-09 22:08:15,700 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse16 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse9 (select |c_#memory_$Pointer$#1.offset| .cse3)) (.cse4 (select .cse5 0)) (.cse14 (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse15 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| .cse14) .cse15)) (.cse8 (select (select |c_#memory_$Pointer$#1.offset| .cse14) .cse15)) (.cse6 (= .cse1 .cse3)) (.cse10 (select |c_#memory_$Pointer$#1.offset| .cse4)) (.cse11 (select .cse9 0))) (and (= (select .cse0 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_old(#valid)_AFTER_CALL_25| .cse2))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 0))) (= .cse1 (select .cse5 4)) (or (= (select (select |c_#memory_int#1| .cse4) 8) 1) (= .cse3 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) .cse6) (= (select (select |c_#memory_$Pointer$#1.offset| .cse7) .cse8) 0) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse7) .cse8)) 8)) (= (select .cse9 4) 0) (or .cse6 (and (= (select .cse10 0) 0) (= .cse11 0))) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse12) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse13 (select |v_#valid_BEFORE_CALL_11| .cse13))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse12) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1)))) (= (select .cse10 (+ .cse11 4)) 0) (= .cse1 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0))))))))) is different from false [2024-11-09 22:08:15,704 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse16 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse9 (select |c_#memory_$Pointer$#1.offset| .cse3)) (.cse4 (select .cse5 0)) (.cse14 (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse15 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| .cse14) .cse15)) (.cse8 (select (select |c_#memory_$Pointer$#1.offset| .cse14) .cse15)) (.cse6 (= .cse1 .cse3)) (.cse10 (select |c_#memory_$Pointer$#1.offset| .cse4)) (.cse11 (select .cse9 0))) (and (= (select .cse0 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_old(#valid)_AFTER_CALL_25| .cse2))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 0))) (= .cse1 (select .cse5 4)) (or (= (select (select |c_#memory_int#1| .cse4) 8) 1) (= .cse3 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) .cse6) (= (select (select |c_#memory_$Pointer$#1.offset| .cse7) .cse8) 0) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse7) .cse8)) 8)) (= (select .cse9 4) 0) (or .cse6 (and (= (select .cse10 0) 0) (= .cse11 0))) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse12) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse13 (select |v_#valid_BEFORE_CALL_11| .cse13))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse12) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1)))) (= (select .cse10 (+ .cse11 4)) 0) (= .cse1 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0))))))))) is different from true [2024-11-09 22:08:15,714 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse8 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse3 (select .cse4 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse7 (= .cse0 .cse2)) (.cse9 (select |c_#memory_$Pointer$#1.offset| .cse3)) (.cse10 (select .cse8 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_old(#valid)_AFTER_CALL_25| .cse1))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0))) (= .cse0 (select .cse4 4)) (or (= (select (select |c_#memory_int#1| .cse3) 8) 1) (= .cse2 .cse3)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse6) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) .cse7) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse6)) 8)) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse8 4) 0) (or .cse7 (and (= (select .cse9 0) 0) (= .cse10 0))) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse11) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse12 (select |v_#valid_BEFORE_CALL_11| .cse12))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse11) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1)))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select .cse9 (+ .cse10 4)) 0) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)))))))) is different from false [2024-11-09 22:08:15,717 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse8 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse3 (select .cse4 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse7 (= .cse0 .cse2)) (.cse9 (select |c_#memory_$Pointer$#1.offset| .cse3)) (.cse10 (select .cse8 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_old(#valid)_AFTER_CALL_25| .cse1))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0))) (= .cse0 (select .cse4 4)) (or (= (select (select |c_#memory_int#1| .cse3) 8) 1) (= .cse2 .cse3)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse6) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) .cse7) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse6)) 8)) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse8 4) 0) (or .cse7 (and (= (select .cse9 0) 0) (= .cse10 0))) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse11) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse12 (select |v_#valid_BEFORE_CALL_11| .cse12))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse11) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1)))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select .cse9 (+ .cse10 4)) 0) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)))))))) is different from true [2024-11-09 22:08:15,729 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse8 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse3 (select .cse4 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse7 (= .cse0 .cse2)) (.cse9 (select |c_#memory_$Pointer$#1.offset| .cse3)) (.cse10 (select .cse8 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) |c_ULTIMATE.start_main_#t~mem20#1|) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_old(#valid)_AFTER_CALL_25| .cse1))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0))) (= .cse0 (select .cse4 4)) (or (= (select (select |c_#memory_int#1| .cse3) 8) 1) (= .cse2 .cse3)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse6) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) .cse7) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse6)) 8)) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse8 4) 0) (or .cse7 (and (= (select .cse9 0) 0) (= .cse10 0))) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse11) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse12 (select |v_#valid_BEFORE_CALL_11| .cse12))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse11) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1)))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select .cse9 (+ .cse10 4)) 0) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)))))))) is different from false [2024-11-09 22:08:15,733 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse8 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse3 (select .cse4 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse7 (= .cse0 .cse2)) (.cse9 (select |c_#memory_$Pointer$#1.offset| .cse3)) (.cse10 (select .cse8 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) |c_ULTIMATE.start_main_#t~mem20#1|) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_old(#valid)_AFTER_CALL_25| .cse1))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0))) (= .cse0 (select .cse4 4)) (or (= (select (select |c_#memory_int#1| .cse3) 8) 1) (= .cse2 .cse3)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse6) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) .cse7) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse6)) 8)) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse8 4) 0) (or .cse7 (and (= (select .cse9 0) 0) (= .cse10 0))) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse11) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_26| .cse12 (select |v_#valid_BEFORE_CALL_11| .cse12))) |v_#valid_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_11| .cse11) 1) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_6) 1)))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select .cse9 (+ .cse10 4)) 0) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)))))))) is different from true [2024-11-09 22:08:15,736 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_96 Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_96) 0))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse2 (select .cse5 0))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and (= 0 (select .cse0 4)) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 0) v_arrayElimCell_96) (= (select (select |c_#memory_int#1| v_arrayElimCell_96) 8) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_old(#valid)_AFTER_CALL_25| .cse3))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_96) 1) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_96) 0) 0) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select .cse0 0) 0) (= (select (select |c_#memory_int#1| .cse2) 8) 1) (= (select .cse4 4) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse2) 1) (= (select .cse5 4) v_arrayElimCell_96) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_96) 0))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) is different from false [2024-11-09 22:08:15,738 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_96 Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_96) 0))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse2 (select .cse5 0))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and (= 0 (select .cse0 4)) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 0) v_arrayElimCell_96) (= (select (select |c_#memory_int#1| v_arrayElimCell_96) 8) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_old(#valid)_AFTER_CALL_25| .cse3))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_96) 1) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_96) 0) 0) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select .cse0 0) 0) (= (select (select |c_#memory_int#1| .cse2) 8) 1) (= (select .cse4 4) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse2) 1) (= (select .cse5 4) v_arrayElimCell_96) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_96) 0))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) is different from true [2024-11-09 22:08:15,742 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_96 Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_96) 0))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse2 (select .cse5 0))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and (= 0 (select .cse0 4)) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 0) v_arrayElimCell_96) (= (select (select |c_#memory_int#1| v_arrayElimCell_96) 8) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_old(#valid)_AFTER_CALL_25| .cse3))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_96) 1) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_96) 0) 0) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select .cse0 0) 0) (= (select (select |c_#memory_int#1| .cse2) 8) 1) (= (select .cse4 4) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse2) 1) (= (select .cse5 4) v_arrayElimCell_96) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_96) 0))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) 8)) (<= |c_ULTIMATE.start_main_#t~mem24#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) is different from false [2024-11-09 22:08:15,744 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_96 Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_96) 0))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse2 (select .cse5 0))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and (= 0 (select .cse0 4)) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 0) v_arrayElimCell_96) (= (select (select |c_#memory_int#1| v_arrayElimCell_96) 8) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_old(#valid)_AFTER_CALL_25| .cse3))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_96) 1) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_96) 0) 0) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select .cse0 0) 0) (= (select (select |c_#memory_int#1| .cse2) 8) 1) (= (select .cse4 4) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse2) 1) (= (select .cse5 4) v_arrayElimCell_96) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_96) 0))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) 8)) (<= |c_ULTIMATE.start_main_#t~mem24#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) is different from true [2024-11-09 22:08:15,747 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (exists ((v_arrayElimIndex_10 Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (v_arrayElimCell_103 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_10) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_103) 0) (= (select (select |c_#memory_int#1| v_arrayElimCell_103) 8) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_old(#valid)_AFTER_CALL_25| .cse1))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_103) 1) (<= 5 (select (select |c_#memory_int#1| v_arrayElimIndex_10) 8)) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 1))) is different from false [2024-11-09 22:08:15,748 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (exists ((v_arrayElimIndex_10 Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (v_arrayElimCell_103 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_10) 0) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_103) 0) (= (select (select |c_#memory_int#1| v_arrayElimCell_103) 8) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_old(#valid)_AFTER_CALL_25|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_old(#valid)_AFTER_CALL_25| .cse1))) |v_old(#valid)_AFTER_CALL_25|) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_103) 1) (<= 5 (select (select |c_#memory_int#1| v_arrayElimIndex_10) 8)) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 1))) is different from true [2024-11-09 22:08:15,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:08:15,994 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2024-11-09 22:08:15,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-09 22:08:15,994 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 41 states have internal predecessors, (71), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2024-11-09 22:08:15,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:08:15,995 INFO L225 Difference]: With dead ends: 75 [2024-11-09 22:08:15,995 INFO L226 Difference]: Without dead ends: 72 [2024-11-09 22:08:15,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 39 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=193, Invalid=1774, Unknown=81, NotChecked=4758, Total=6806 [2024-11-09 22:08:15,997 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 2677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2155 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 22:08:15,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 513 Invalid, 2677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 516 Invalid, 0 Unknown, 2155 Unchecked, 0.4s Time] [2024-11-09 22:08:15,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-09 22:08:16,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-09 22:08:16,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.0952380952380953) internal successors, (69), 63 states have internal predecessors, (69), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 22:08:16,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2024-11-09 22:08:16,005 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 46 [2024-11-09 22:08:16,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:08:16,005 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2024-11-09 22:08:16,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 41 states have internal predecessors, (71), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 22:08:16,005 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2024-11-09 22:08:16,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 22:08:16,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:08:16,005 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, 1, 1, 1, 1, 1] [2024-11-09 22:08:16,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 22:08:16,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 22:08:16,206 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:08:16,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:08:16,206 INFO L85 PathProgramCache]: Analyzing trace with hash -663917700, now seen corresponding path program 1 times [2024-11-09 22:08:16,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:08:16,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031145827] [2024-11-09 22:08:16,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:08:16,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:08:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:16,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:08:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:16,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:08:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:16,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:08:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:16,343 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 22:08:16,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:08:16,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031145827] [2024-11-09 22:08:16,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031145827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:08:16,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:08:16,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 22:08:16,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820451869] [2024-11-09 22:08:16,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:08:16,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 22:08:16,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:08:16,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 22:08:16,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 22:08:16,344 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 22:08:16,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:08:16,415 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2024-11-09 22:08:16,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 22:08:16,415 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-09 22:08:16,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:08:16,416 INFO L225 Difference]: With dead ends: 96 [2024-11-09 22:08:16,416 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 22:08:16,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 22:08:16,416 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 22 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:08:16,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 221 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:08:16,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 22:08:16,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 75. [2024-11-09 22:08:16,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 66 states have (on average 1.106060606060606) internal successors, (73), 66 states have internal predecessors, (73), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 22:08:16,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2024-11-09 22:08:16,425 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 48 [2024-11-09 22:08:16,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:08:16,426 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2024-11-09 22:08:16,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 22:08:16,426 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2024-11-09 22:08:16,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 22:08:16,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:08:16,426 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:08:16,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 22:08:16,427 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:08:16,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:08:16,427 INFO L85 PathProgramCache]: Analyzing trace with hash 894629428, now seen corresponding path program 1 times [2024-11-09 22:08:16,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:08:16,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719764060] [2024-11-09 22:08:16,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:08:16,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:08:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:17,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:08:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:17,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:08:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:17,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:08:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:17,913 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 22:08:17,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:08:17,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719764060] [2024-11-09 22:08:17,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719764060] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:08:17,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709386574] [2024-11-09 22:08:17,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:08:17,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:08:17,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:08:17,915 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:08:17,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 22:08:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:18,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 180 conjuncts are in the unsatisfiable core [2024-11-09 22:08:18,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:08:18,283 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-09 22:08:18,458 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from false [2024-11-09 22:08:18,460 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from true [2024-11-09 22:08:18,468 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-09 22:08:18,471 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-09 22:08:18,486 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from false [2024-11-09 22:08:18,488 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from true [2024-11-09 22:08:18,509 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 22:08:18,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2024-11-09 22:08:18,525 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-09 22:08:18,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2024-11-09 22:08:18,531 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |c_#valid| .cse1)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2024-11-09 22:08:18,533 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |c_#valid| .cse1)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from true [2024-11-09 22:08:18,555 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |c_#valid| .cse1)))))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) is different from false [2024-11-09 22:08:18,556 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |c_#valid| .cse1)))))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) is different from true [2024-11-09 22:08:18,611 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 22:08:18,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 72 [2024-11-09 22:08:18,629 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-09 22:08:18,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 38 [2024-11-09 22:08:18,654 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse1 0))) (and (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select .cse1 4) .cse0) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |c_#valid| .cse2))))))))) is different from false [2024-11-09 22:08:18,656 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse1 0))) (and (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select .cse1 4) .cse0) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |c_#valid| .cse2))))))))) is different from true [2024-11-09 22:08:18,694 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse2 (select .cse1 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse0) 1) (= (select .cse1 4) .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse3 (select |c_#valid| .cse3)))))) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0))))) is different from false [2024-11-09 22:08:18,695 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse2 (select .cse1 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse0) 1) (= (select .cse1 4) .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse3 (select |c_#valid| .cse3)))))) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0))))) is different from true [2024-11-09 22:08:18,706 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 22:08:18,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 26 [2024-11-09 22:08:18,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:08:18,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-09 22:08:18,733 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-09 22:08:18,735 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-09 22:08:18,758 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |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)|)) is different from false [2024-11-09 22:08:18,760 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |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)|)) is different from true [2024-11-09 22:08:18,800 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from false [2024-11-09 22:08:18,801 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from true [2024-11-09 22:08:18,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:08:18,858 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-09 22:08:18,858 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 75 treesize of output 52 [2024-11-09 22:08:18,882 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2024-11-09 22:08:18,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 73 [2024-11-09 22:08:18,929 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse3 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse1) 0))) (= (select .cse3 4) .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0)))))) is different from false [2024-11-09 22:08:18,931 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse3 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse1) 0))) (= (select .cse3 4) .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0)))))) is different from true [2024-11-09 22:08:19,016 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse2 (select .cse1 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0)) (= (select .cse1 4) .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_28| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_30| .cse5 (select |v_#valid_BEFORE_CALL_16| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (or (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))))) is different from false [2024-11-09 22:08:19,018 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse2 (select .cse1 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0)) (= (select .cse1 4) .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_28| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_30| .cse5 (select |v_#valid_BEFORE_CALL_16| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (or (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))))) is different from true [2024-11-09 22:08:19,153 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0)) (.cse2 (select .cse3 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse0) (= .cse1 0)) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse2) (= (select .cse3 4) .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse1) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_30| .cse6 (select |v_#valid_BEFORE_CALL_16| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (or (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))))) is different from false [2024-11-09 22:08:19,156 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0)) (.cse2 (select .cse3 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse0) (= .cse1 0)) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse2) (= (select .cse3 4) .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse1) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_30| .cse6 (select |v_#valid_BEFORE_CALL_16| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (or (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))))) is different from true [2024-11-09 22:08:19,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:08:19,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:08:19,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:08:19,356 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-11-09 22:08:19,356 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 555 treesize of output 369 [2024-11-09 22:08:19,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:08:19,407 INFO L349 Elim1Store]: treesize reduction 162, result has 19.0 percent of original size [2024-11-09 22:08:19,407 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 315 treesize of output 108 [2024-11-09 22:08:19,452 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 22:08:19,469 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse4 (select .cse8 0)) (.cse0 (select .cse8 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse2 (select |c_#memory_$Pointer$#1.base| .cse4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= .cse1 (select .cse2 4)) (= (select .cse3 0) 0) (not (= .cse0 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_30| .cse7 (select |v_#valid_BEFORE_CALL_16| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse1) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0) (= (select .cse3 4) 0) (= .cse0 (select .cse2 0))))))) is different from false [2024-11-09 22:08:19,472 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse4 (select .cse8 0)) (.cse0 (select .cse8 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse2 (select |c_#memory_$Pointer$#1.base| .cse4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= .cse1 (select .cse2 4)) (= (select .cse3 0) 0) (not (= .cse0 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_30| .cse7 (select |v_#valid_BEFORE_CALL_16| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse1) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0) (= (select .cse3 4) 0) (= .cse0 (select .cse2 0))))))) is different from true [2024-11-09 22:08:19,562 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse4 (select .cse8 0)) (.cse0 (select .cse8 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse2 (select |c_#memory_$Pointer$#1.base| .cse4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= .cse1 (select .cse2 4)) (= (select .cse3 0) 0) (not (= .cse0 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_30| .cse7 (select |v_#valid_BEFORE_CALL_16| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse1) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0) (= (select .cse3 4) 0) (= .cse0 (select .cse2 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)))))) is different from false [2024-11-09 22:08:19,566 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse4 (select .cse8 0)) (.cse0 (select .cse8 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse2 (select |c_#memory_$Pointer$#1.base| .cse4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= .cse1 (select .cse2 4)) (= (select .cse3 0) 0) (not (= .cse0 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_30| .cse7 (select |v_#valid_BEFORE_CALL_16| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse1) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0) (= (select .cse3 4) 0) (= .cse0 (select .cse2 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)))))) is different from true [2024-11-09 22:08:19,650 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse4 (select .cse8 0)) (.cse0 (select .cse8 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse2 (select |c_#memory_$Pointer$#1.base| .cse4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) |c_ULTIMATE.start_main_#t~mem20#1|) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= .cse1 (select .cse2 4)) (= (select .cse3 0) 0) (not (= .cse0 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_30| .cse7 (select |v_#valid_BEFORE_CALL_16| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse1) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0) (= (select .cse3 4) 0) (= .cse0 (select .cse2 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)))))) is different from false [2024-11-09 22:08:19,653 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse4 (select .cse8 0)) (.cse0 (select .cse8 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse2 (select |c_#memory_$Pointer$#1.base| .cse4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) |c_ULTIMATE.start_main_#t~mem20#1|) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= .cse1 (select .cse2 4)) (= (select .cse3 0) 0) (not (= .cse0 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_30| .cse7 (select |v_#valid_BEFORE_CALL_16| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse1) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0) (= (select .cse3 4) 0) (= .cse0 (select .cse2 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)))))) is different from true [2024-11-09 22:08:19,725 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse4 (select .cse8 0)) (.cse1 (select .cse8 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse2 (select |c_#memory_$Pointer$#1.base| .cse4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_int#1| .cse0) 8) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 0) .cse0) (= .cse0 (select .cse2 4)) (= (select .cse3 0) 0) (not (= .cse1 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_30| .cse7 (select |v_#valid_BEFORE_CALL_16| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse0) 0))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0) (= (select .cse3 4) 0) (= .cse1 (select .cse2 0))))))) is different from false [2024-11-09 22:08:19,728 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse4 (select .cse8 0)) (.cse1 (select .cse8 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse2 (select |c_#memory_$Pointer$#1.base| .cse4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_int#1| .cse0) 8) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 0) .cse0) (= .cse0 (select .cse2 4)) (= (select .cse3 0) 0) (not (= .cse1 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_30| .cse7 (select |v_#valid_BEFORE_CALL_16| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse0) 0))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0) (= (select .cse3 4) 0) (= .cse1 (select .cse2 0))))))) is different from true [2024-11-09 22:08:19,866 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse4 (select .cse8 0)) (.cse1 (select .cse8 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse2 (select |c_#memory_$Pointer$#1.base| .cse4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_int#1| .cse0) 8) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 0) .cse0) (= .cse0 (select .cse2 4)) (= (select .cse3 0) 0) (not (= .cse1 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (<= |c_ULTIMATE.start_main_#t~mem24#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_30| .cse7 (select |v_#valid_BEFORE_CALL_16| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse0) 0))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0) (= (select .cse3 4) 0) (= .cse1 (select .cse2 0))))))) is different from false [2024-11-09 22:08:19,869 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse4 (select .cse8 0)) (.cse1 (select .cse8 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse2 (select |c_#memory_$Pointer$#1.base| .cse4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_int#1| .cse0) 8) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 0) .cse0) (= .cse0 (select .cse2 4)) (= (select .cse3 0) 0) (not (= .cse1 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (<= |c_ULTIMATE.start_main_#t~mem24#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_30| .cse7 (select |v_#valid_BEFORE_CALL_16| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse0) 0))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0) (= (select .cse3 4) 0) (= .cse1 (select .cse2 0))))))) is different from true [2024-11-09 22:08:19,939 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse7 (select .cse9 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse1 (select .cse9 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse4 (select .cse2 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_int#1| .cse0) 8) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 0) .cse0) (= .cse0 (select .cse2 4)) (= (select .cse3 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (<= 5 (select (select |c_#memory_int#1| .cse7) 8)) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_30| .cse8 (select |v_#valid_BEFORE_CALL_16| .cse8)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse0) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse7) 0) 0) (= (select .cse3 4) 0) (= .cse1 .cse4))))))) is different from false [2024-11-09 22:08:19,942 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse7 (select .cse9 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse1 (select .cse9 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse4 (select .cse2 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_int#1| .cse0) 8) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 0) .cse0) (= .cse0 (select .cse2 4)) (= (select .cse3 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (<= 5 (select (select |c_#memory_int#1| .cse7) 8)) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_30| .cse8 (select |v_#valid_BEFORE_CALL_16| .cse8)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse0) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse7) 0) 0) (= (select .cse3 4) 0) (= .cse1 .cse4))))))) is different from true [2024-11-09 22:08:19,995 INFO L349 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2024-11-09 22:08:19,995 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 27 treesize of output 23 [2024-11-09 22:08:20,013 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse7 (select .cse9 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse0 (select .cse9 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse4 (select .cse2 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= .cse1 (select .cse2 4)) (= (select .cse3 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (not (= .cse1 .cse7)) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_30| .cse8 (select |v_#valid_BEFORE_CALL_16| .cse8)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse1) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse7) 0) 0) (= (select .cse3 4) 0) (= .cse0 .cse4))))))) is different from false [2024-11-09 22:08:20,015 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse7 (select .cse9 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse0 (select .cse9 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse4 (select .cse2 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= .cse1 (select .cse2 4)) (= (select .cse3 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (not (= .cse1 .cse7)) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_30| .cse8 (select |v_#valid_BEFORE_CALL_16| .cse8)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse1) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse7) 0) 0) (= (select .cse3 4) 0) (= .cse0 .cse4))))))) is different from true [2024-11-09 22:08:20,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:08:20,044 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 241 treesize of output 165 [2024-11-09 22:08:20,060 INFO L349 Elim1Store]: treesize reduction 54, result has 5.3 percent of original size [2024-11-09 22:08:20,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 127 treesize of output 67 [2024-11-09 22:08:20,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:08:20,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:08:20,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 22:08:20,084 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 22:08:20,084 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-09 22:08:20,089 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (v_arrayElimIndex_19 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_30| |c_ULTIMATE.start_main_#t~mem30#1.base|)) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_main_#t~mem30#1.base|) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_30| .cse0 (select |v_#valid_BEFORE_CALL_16| .cse0)))) (= (select |v_#valid_BEFORE_CALL_16| v_arrayElimIndex_18) 0) (= (select |v_old(#valid)_AFTER_CALL_30| v_arrayElimIndex_19) 1))) (= |c_ULTIMATE.start_main_#t~mem30#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_#t~mem30#1.offset|)) is different from false [2024-11-09 22:08:20,091 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (v_arrayElimIndex_19 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_30| |c_ULTIMATE.start_main_#t~mem30#1.base|)) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_main_#t~mem30#1.base|) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_30| .cse0 (select |v_#valid_BEFORE_CALL_16| .cse0)))) (= (select |v_#valid_BEFORE_CALL_16| v_arrayElimIndex_18) 0) (= (select |v_old(#valid)_AFTER_CALL_30| v_arrayElimIndex_19) 1))) (= |c_ULTIMATE.start_main_#t~mem30#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_#t~mem30#1.offset|)) is different from true [2024-11-09 22:08:20,092 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2024-11-09 22:08:20,092 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:08:20,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:08:20,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 28 treesize of output 27 [2024-11-09 22:08:24,319 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4))) (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (.cse6 (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) (store .cse18 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse18 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse12 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (.cse8 (+ |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4)) (.cse11 (select .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (.cse5 (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_2931 Int) (v_ArrVal_2932 Int)) (= (let ((.cse3 (let ((.cse9 (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse11 .cse12 v_ArrVal_2932) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)))) (store .cse9 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (.cse0 (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse7 .cse8 v_ArrVal_2931)))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (select (select .cse3 .cse4) .cse5))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) .cse4)) (forall ((v_ArrVal_2931 Int) (v_ArrVal_2932 Int)) (= (let ((.cse13 (let ((.cse17 (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse11 .cse12 v_ArrVal_2932) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)))) (store .cse17 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse17 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (.cse14 (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse7 .cse8 v_ArrVal_2931)))) (let ((.cse15 (select (select .cse14 .cse4) .cse5)) (.cse16 (select (select .cse13 .cse4) .cse5))) (select (select .cse13 (select (select .cse14 .cse15) .cse16)) (select (select .cse13 .cse15) .cse16)))) .cse5)))))) is different from false