./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 18:24:02,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:24:03,019 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:24:03,022 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:24:03,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:24:03,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:24:03,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:24:03,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:24:03,038 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:24:03,039 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:24:03,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:24:03,039 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:24:03,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:24:03,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:24:03,040 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:24:03,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:24:03,040 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:24:03,041 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:24:03,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:24:03,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:24:03,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:24:03,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:24:03,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:24:03,042 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:24:03,042 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:24:03,043 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:24:03,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:24:03,043 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:24:03,043 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:24:03,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:24:03,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:24:03,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:24:03,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:24:03,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:24:03,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:24:03,044 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:24:03,044 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:24:03,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:24:03,045 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:24:03,045 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:24:03,048 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:24:03,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:24:03,049 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 -> 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 [2024-10-12 18:24:03,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:24:03,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:24:03,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:24:03,274 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:24:03,278 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:24:03,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2024-10-12 18:24:04,585 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:24:04,788 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:24:04,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2024-10-12 18:24:04,801 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77577d707/01003046a508469e925e04b5bf8c064f/FLAG6d885a64e [2024-10-12 18:24:05,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77577d707/01003046a508469e925e04b5bf8c064f [2024-10-12 18:24:05,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:24:05,154 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:24:05,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:24:05,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:24:05,160 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:24:05,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:24:05" (1/1) ... [2024-10-12 18:24:05,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16bb1ff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:05, skipping insertion in model container [2024-10-12 18:24:05,162 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:24:05" (1/1) ... [2024-10-12 18:24:05,194 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:24:05,443 WARN L248 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_append_unequal.i[24672,24685] [2024-10-12 18:24:05,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:24:05,455 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:24:05,487 WARN L248 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_append_unequal.i[24672,24685] [2024-10-12 18:24:05,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:24:05,515 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:24:05,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:05 WrapperNode [2024-10-12 18:24:05,516 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:24:05,517 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:24:05,517 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:24:05,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:24:05,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:05" (1/1) ... [2024-10-12 18:24:05,539 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:05" (1/1) ... [2024-10-12 18:24:05,558 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 149 [2024-10-12 18:24:05,559 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:24:05,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:24:05,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:24:05,560 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:24:05,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:05" (1/1) ... [2024-10-12 18:24:05,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:05" (1/1) ... [2024-10-12 18:24:05,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:05" (1/1) ... [2024-10-12 18:24:05,588 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 20, 9]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 14 writes are split as follows [0, 13, 1]. [2024-10-12 18:24:05,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:05" (1/1) ... [2024-10-12 18:24:05,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:05" (1/1) ... [2024-10-12 18:24:05,595 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:05" (1/1) ... [2024-10-12 18:24:05,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:05" (1/1) ... [2024-10-12 18:24:05,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:05" (1/1) ... [2024-10-12 18:24:05,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:05" (1/1) ... [2024-10-12 18:24:05,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:24:05,611 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:24:05,611 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:24:05,611 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:24:05,612 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:05" (1/1) ... [2024-10-12 18:24:05,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:24:05,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:24:05,644 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-10-12 18:24:05,647 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-10-12 18:24:05,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 18:24:05,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 18:24:05,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 18:24:05,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 18:24:05,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 18:24:05,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 18:24:05,691 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-12 18:24:05,691 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-12 18:24:05,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-12 18:24:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:24:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 18:24:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-12 18:24:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-12 18:24:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-12 18:24:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-12 18:24:05,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-12 18:24:05,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-12 18:24:05,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 18:24:05,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-12 18:24:05,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-12 18:24:05,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-12 18:24:05,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 18:24:05,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 18:24:05,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 18:24:05,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:24:05,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:24:05,843 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:24:05,846 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:24:06,175 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-10-12 18:24:06,175 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:24:06,211 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:24:06,211 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-12 18:24:06,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:24:06 BoogieIcfgContainer [2024-10-12 18:24:06,212 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:24:06,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:24:06,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:24:06,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:24:06,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:24:05" (1/3) ... [2024-10-12 18:24:06,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5fbb06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:24:06, skipping insertion in model container [2024-10-12 18:24:06,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:05" (2/3) ... [2024-10-12 18:24:06,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5fbb06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:24:06, skipping insertion in model container [2024-10-12 18:24:06,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:24:06" (3/3) ... [2024-10-12 18:24:06,221 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2024-10-12 18:24:06,234 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:24:06,234 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 18:24:06,277 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:24:06,282 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;@1e07321e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:24:06,283 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 18:24:06,289 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 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-10-12 18:24:06,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-12 18:24:06,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:24:06,296 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:24:06,296 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:24:06,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:24:06,300 INFO L85 PathProgramCache]: Analyzing trace with hash -977421440, now seen corresponding path program 1 times [2024-10-12 18:24:06,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:24:06,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647386885] [2024-10-12 18:24:06,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:06,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:24:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:06,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:24:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:06,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:24:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:06,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:24:06,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:24:06,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647386885] [2024-10-12 18:24:06,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647386885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:24:06,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:24:06,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 18:24:06,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960867942] [2024-10-12 18:24:06,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:24:06,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 18:24:06,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:24:06,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 18:24:06,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:24:06,668 INFO L87 Difference]: Start difference. First operand has 31 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-10-12 18:24:06,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:24:06,739 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2024-10-12 18:24:06,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 18:24:06,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 18 [2024-10-12 18:24:06,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:24:06,746 INFO L225 Difference]: With dead ends: 54 [2024-10-12 18:24:06,746 INFO L226 Difference]: Without dead ends: 24 [2024-10-12 18:24:06,749 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-10-12 18:24:06,754 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 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.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:24:06,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:24:06,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-12 18:24:06,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-12 18:24:06,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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-10-12 18:24:06,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-12 18:24:06,788 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 18 [2024-10-12 18:24:06,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:24:06,790 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-12 18:24:06,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-10-12 18:24:06,790 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-12 18:24:06,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-12 18:24:06,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:24:06,792 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:24:06,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 18:24:06,792 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:24:06,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:24:06,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1639470509, now seen corresponding path program 1 times [2024-10-12 18:24:06,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:24:06,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817066678] [2024-10-12 18:24:06,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:06,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:24:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:06,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:24:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:06,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:24:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:06,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:24:06,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:24:06,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817066678] [2024-10-12 18:24:07,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817066678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:24:07,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:24:07,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:24:07,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794503511] [2024-10-12 18:24:07,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:24:07,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:24:07,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:24:07,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:24:07,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:24:07,004 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-12 18:24:07,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:24:07,061 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2024-10-12 18:24:07,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:24:07,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 18 [2024-10-12 18:24:07,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:24:07,063 INFO L225 Difference]: With dead ends: 45 [2024-10-12 18:24:07,063 INFO L226 Difference]: Without dead ends: 29 [2024-10-12 18:24:07,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-10-12 18:24:07,064 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 60 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-10-12 18:24:07,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 60 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:24:07,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-12 18:24:07,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2024-10-12 18:24:07,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 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-10-12 18:24:07,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2024-10-12 18:24:07,074 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 18 [2024-10-12 18:24:07,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:24:07,075 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-10-12 18:24:07,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-12 18:24:07,075 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2024-10-12 18:24:07,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-12 18:24:07,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:24:07,076 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:24:07,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 18:24:07,077 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:24:07,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:24:07,078 INFO L85 PathProgramCache]: Analyzing trace with hash -2143999192, now seen corresponding path program 1 times [2024-10-12 18:24:07,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:24:07,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604043099] [2024-10-12 18:24:07,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:07,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:24:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:07,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:24:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:07,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:24:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:07,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 18:24:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:07,495 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 18:24:07,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:24:07,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604043099] [2024-10-12 18:24:07,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604043099] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:24:07,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567441523] [2024-10-12 18:24:07,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:07,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:24:07,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:24:07,499 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-10-12 18:24:07,501 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-10-12 18:24:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:07,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-12 18:24:07,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:24:07,801 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-10-12 18:24:07,817 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:24:07,819 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:24:07,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 18:24:07,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567441523] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:24:07,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:24:07,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 13 [2024-10-12 18:24:07,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086992286] [2024-10-12 18:24:07,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:24:07,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 18:24:07,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:24:07,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 18:24:07,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-12 18:24:07,900 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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-10-12 18:24:11,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-12 18:24:15,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-12 18:24:19,968 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-10-12 18:24:23,994 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-10-12 18:24:28,012 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-10-12 18:24:32,251 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-10-12 18:24:36,271 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-10-12 18:24:36,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:24:36,277 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2024-10-12 18:24:36,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 18:24:36,282 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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 26 [2024-10-12 18:24:36,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:24:36,283 INFO L225 Difference]: With dead ends: 52 [2024-10-12 18:24:36,283 INFO L226 Difference]: Without dead ends: 31 [2024-10-12 18:24:36,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-10-12 18:24:36,284 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 16 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.3s IncrementalHoareTripleChecker+Time [2024-10-12 18:24:36,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 214 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 7 Unknown, 0 Unchecked, 28.3s Time] [2024-10-12 18:24:36,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-12 18:24:36,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-12 18:24:36,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 18:24:36,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-10-12 18:24:36,293 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 26 [2024-10-12 18:24:36,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:24:36,294 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-10-12 18:24:36,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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-10-12 18:24:36,294 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-10-12 18:24:36,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-12 18:24:36,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:24:36,295 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:24:36,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 18:24:36,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:24:36,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:24:36,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:24:36,498 INFO L85 PathProgramCache]: Analyzing trace with hash -2142152150, now seen corresponding path program 1 times [2024-10-12 18:24:36,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:24:36,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054337602] [2024-10-12 18:24:36,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:36,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:24:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:38,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:24:38,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:38,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:24:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:38,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 18:24:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:38,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:24:38,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:24:38,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054337602] [2024-10-12 18:24:38,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054337602] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:24:38,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992700437] [2024-10-12 18:24:38,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:38,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:24:38,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:24:38,497 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-10-12 18:24:38,498 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-10-12 18:24:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:38,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-10-12 18:24:38,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:24:39,030 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-10-12 18:24:39,186 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-10-12 18:24:39,255 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-12 18:24:39,256 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-10-12 18:24:39,326 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-10-12 18:24:39,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 18:24:39,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:39,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2024-10-12 18:24:39,530 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-10-12 18:24:39,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:39,538 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 34 [2024-10-12 18:24:39,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 1 [2024-10-12 18:24:39,597 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-10-12 18:24:39,601 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-10-12 18:24:39,605 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-10-12 18:24:39,814 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-12 18:24:39,815 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-10-12 18:24:39,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:39,842 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-10-12 18:24:39,858 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-12 18:24:39,858 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-10-12 18:24:40,014 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 84 treesize of output 52 [2024-10-12 18:24:40,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:40,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:40,020 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 45 treesize of output 36 [2024-10-12 18:24:40,026 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-10-12 18:24:40,081 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-10-12 18:24:40,147 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:24:40,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:24:40,215 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int)) (v_ArrVal_680 (Array Int Int)) (v_ArrVal_678 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2) v_ArrVal_680) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_677))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_678)))) (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-10-12 18:24:40,224 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int)) (v_ArrVal_680 (Array Int Int)) (v_ArrVal_678 Int)) (= (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2) v_ArrVal_680) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_677))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_678)))) (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|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2024-10-12 18:24:40,294 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_677 (Array Int Int)) (v_ArrVal_680 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_16| Int) (v_ArrVal_678 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_16| v_ArrVal_688) .cse1) .cse2) v_ArrVal_680) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_16| v_ArrVal_677))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_678)))) (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 (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_16|) 0)))) is different from false [2024-10-12 18:24:40,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992700437] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:24:40,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:24:40,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2024-10-12 18:24:40,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289098984] [2024-10-12 18:24:40,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:24:40,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-12 18:24:40,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:24:40,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-12 18:24:40,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1675, Unknown=3, NotChecked=252, Total=2070 [2024-10-12 18:24:40,299 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 41 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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-10-12 18:24:41,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:24:41,122 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2024-10-12 18:24:41,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-12 18:24:41,123 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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 26 [2024-10-12 18:24:41,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:24:41,124 INFO L225 Difference]: With dead ends: 55 [2024-10-12 18:24:41,124 INFO L226 Difference]: Without dead ends: 53 [2024-10-12 18:24:41,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=241, Invalid=2848, Unknown=3, NotChecked=330, Total=3422 [2024-10-12 18:24:41,126 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 44 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 18:24:41,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 247 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 18:24:41,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-12 18:24:41,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2024-10-12 18:24:41,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 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-10-12 18:24:41,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2024-10-12 18:24:41,133 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 26 [2024-10-12 18:24:41,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:24:41,134 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2024-10-12 18:24:41,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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-10-12 18:24:41,134 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2024-10-12 18:24:41,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-12 18:24:41,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:24:41,135 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:24:41,150 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-10-12 18:24:41,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-12 18:24:41,336 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:24:41,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:24:41,336 INFO L85 PathProgramCache]: Analyzing trace with hash 2125151189, now seen corresponding path program 1 times [2024-10-12 18:24:41,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:24:41,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779827201] [2024-10-12 18:24:41,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:41,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:24:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:42,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:24:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:42,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:24:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:42,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 18:24:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:42,594 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:24:42,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:24:42,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779827201] [2024-10-12 18:24:42,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779827201] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:24:42,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433454545] [2024-10-12 18:24:42,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:42,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:24:42,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:24:42,596 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-10-12 18:24:42,597 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-10-12 18:24:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:42,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-10-12 18:24:42,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:24:42,849 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-10-12 18:24:42,968 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) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from false [2024-10-12 18:24:42,969 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) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from true [2024-10-12 18:24:42,984 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-10-12 18:24:42,992 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_~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)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |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-10-12 18:24:42,994 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_~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)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |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-10-12 18:24:43,008 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-12 18:24:43,009 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 33 treesize of output 32 [2024-10-12 18:24:43,023 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 (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) is different from false [2024-10-12 18:24:43,025 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 (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) is different from true [2024-10-12 18:24:43,042 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) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .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) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1))))) is different from false [2024-10-12 18:24:43,044 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) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .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) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1))))) is different from true [2024-10-12 18:24:43,086 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2024-10-12 18:24:43,087 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 118 treesize of output 104 [2024-10-12 18:24:43,093 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 104 treesize of output 94 [2024-10-12 18:24:43,104 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 91 treesize of output 38 [2024-10-12 18:24:43,128 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) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select .cse1 4) .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1))))))) is different from false [2024-10-12 18:24:43,129 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) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select .cse1 4) .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1))))))) is different from true [2024-10-12 18:24:43,137 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 33 treesize of output 9 [2024-10-12 18:24:43,152 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from false [2024-10-12 18:24:43,154 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from true [2024-10-12 18:24:43,173 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from false [2024-10-12 18:24:43,175 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from true [2024-10-12 18:24:43,193 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 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|))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from false [2024-10-12 18:24:43,195 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 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|))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from true [2024-10-12 18:24:43,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:43,222 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 41 treesize of output 24 [2024-10-12 18:24:43,246 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 ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse1 (select .cse3 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))) (= (select .cse3 4) .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))))))))))) is different from false [2024-10-12 18:24:43,249 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 ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse1 (select .cse3 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))) (= (select .cse3 4) .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))))))))))) is different from true [2024-10-12 18:24:43,305 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 ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse1 (select .cse0 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select .cse0 4) .cse1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))))))))))) is different from false [2024-10-12 18:24:43,307 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 ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse1 (select .cse0 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select .cse0 4) .cse1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))))))))))) is different from true [2024-10-12 18:24:43,375 INFO L349 Elim1Store]: treesize reduction 344, result has 9.9 percent of original size [2024-10-12 18:24:43,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 174 treesize of output 117 [2024-10-12 18:24:43,412 INFO L349 Elim1Store]: treesize reduction 120, result has 11.1 percent of original size [2024-10-12 18:24:43,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 146 treesize of output 126 [2024-10-12 18:24:43,427 INFO L349 Elim1Store]: treesize reduction 111, result has 0.9 percent of original size [2024-10-12 18:24:43,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 185 treesize of output 76 [2024-10-12 18:24:43,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-12 18:24:43,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 36 [2024-10-12 18:24:43,458 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 17 treesize of output 15 [2024-10-12 18:24:43,461 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 15 treesize of output 11 [2024-10-12 18:24:43,472 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 |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse0 (select .cse2 4))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| (select .cse2 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3)))) (= (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) (not (= .cse0 .cse3)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))))))))))) is different from false [2024-10-12 18:24:43,475 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 |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse0 (select .cse2 4))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| (select .cse2 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3)))) (= (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) (not (= .cse0 .cse3)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))))))))))) is different from true [2024-10-12 18:24:43,516 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 |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse0 (select .cse2 4))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| (select .cse2 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3)))) (= (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 (= .cse0 .cse3)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3))))) is different from false [2024-10-12 18:24:43,519 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 |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse0 (select .cse2 4))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| (select .cse2 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3)))) (= (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 (= .cse0 .cse3)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3))))) is different from true [2024-10-12 18:24:43,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:24:43,572 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 101 treesize of output 69 [2024-10-12 18:24:43,578 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 41 treesize of output 21 [2024-10-12 18:24:43,593 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-12 18:24:43,593 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-10-12 18:24:43,612 WARN L851 $PredicateComparison]: unable to prove that (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_42 Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_42) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_#t~mem21#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_42) 0))) is different from false [2024-10-12 18:24:47,644 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_42 Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_42) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_#t~mem21#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_42) 0))) is different from true [2024-10-12 18:24:47,662 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-12 18:24:47,663 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:24:47,734 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 434 treesize of output 350 [2024-10-12 18:24:49,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433454545] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:24:49,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:24:49,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 38 [2024-10-12 18:24:49,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384834823] [2024-10-12 18:24:49,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:24:49,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-12 18:24:49,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:24:49,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-12 18:24:49,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=786, Unknown=39, NotChecked=884, Total=1806 [2024-10-12 18:24:49,745 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 38 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 29 states have internal predecessors, (41), 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-10-12 18:24:49,935 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) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from false [2024-10-12 18:24:49,938 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) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from true [2024-10-12 18:24:49,943 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) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |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| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |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-10-12 18:24:49,946 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) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |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| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |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-10-12 18:24:49,950 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 (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| .cse0) 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.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2024-10-12 18:24:49,953 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 (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| .cse0) 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.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from true [2024-10-12 18:24:49,957 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 (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~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|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .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) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1))))) is different from false [2024-10-12 18:24:49,960 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 (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~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|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .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) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1))))) is different from true [2024-10-12 18:24:49,971 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse6 0)) (.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select .cse4 0)) (.cse1 (select |c_#memory_$Pointer$#1.base| .cse2))) (and (= (select .cse0 0) 0) (not (= (select .cse1 4) .cse2)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |c_#valid| .cse3) 1) (= (select .cse4 4) .cse5) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse2) 1) (= .cse2 (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= .cse6 .cse7) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse8 (select |c_#valid| .cse8)))) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse5) 1))) (= (select |c_#valid| (select .cse1 0)) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0)))))) is different from false [2024-10-12 18:24:49,975 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse6 0)) (.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select .cse4 0)) (.cse1 (select |c_#memory_$Pointer$#1.base| .cse2))) (and (= (select .cse0 0) 0) (not (= (select .cse1 4) .cse2)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |c_#valid| .cse3) 1) (= (select .cse4 4) .cse5) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse2) 1) (= .cse2 (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= .cse6 .cse7) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse8 (select |c_#valid| .cse8)))) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse5) 1))) (= (select |c_#valid| (select .cse1 0)) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0)))))) is different from true [2024-10-12 18:24:50,002 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_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from false [2024-10-12 18:24:50,005 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_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from true [2024-10-12 18:24:50,015 WARN L851 $PredicateComparison]: unable to prove that (and (= |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_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from false [2024-10-12 18:24:50,019 WARN L873 $PredicateComparison]: unable to prove that (and (= |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_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from true [2024-10-12 18:24:50,029 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_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#valid| (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse1 (select |c_#valid| .cse1)))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))))))))) is different from false [2024-10-12 18:24:50,034 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_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#valid| (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse1 (select |c_#valid| .cse1)))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))))))))) is different from true [2024-10-12 18:24:50,049 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse5 (select .cse7 0))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse2 (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select .cse6 0))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (select .cse0 0))) (= (select .cse1 0) 0) (not (= (select .cse0 4) .cse2)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_old(#valid)_AFTER_CALL_9| .cse3))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse5) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse2)) (= (select .cse6 4) .cse4) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse2 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= .cse7 .cse8) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse9) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse10 (select |v_#valid_BEFORE_CALL_7| .cse10))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0)))))) is different from false [2024-10-12 18:24:50,053 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse5 (select .cse7 0))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse2 (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select .cse6 0))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (select .cse0 0))) (= (select .cse1 0) 0) (not (= (select .cse0 4) .cse2)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_old(#valid)_AFTER_CALL_9| .cse3))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse5) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse2)) (= (select .cse6 4) .cse4) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse2 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= .cse7 .cse8) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse9) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse10 (select |v_#valid_BEFORE_CALL_7| .cse10))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0)))))) is different from true [2024-10-12 18:24:50,085 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse7 0)) (.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse2 (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse6))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select .cse3 0)) (.cse1 (select |c_#memory_$Pointer$#1.base| .cse2))) (and (= (select .cse0 0) 0) (not (= (select .cse1 4) .cse2)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select .cse3 4) .cse4) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_old(#valid)_AFTER_CALL_9| .cse5))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse6) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse6)) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse1 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse2)) (= .cse2 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= .cse7 .cse8) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse9) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse10 (select |v_#valid_BEFORE_CALL_7| .cse10))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0)))))) is different from false [2024-10-12 18:24:50,089 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse7 0)) (.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse2 (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse6))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select .cse3 0)) (.cse1 (select |c_#memory_$Pointer$#1.base| .cse2))) (and (= (select .cse0 0) 0) (not (= (select .cse1 4) .cse2)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select .cse3 4) .cse4) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_old(#valid)_AFTER_CALL_9| .cse5))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse6) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse6)) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse1 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse2)) (= .cse2 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= .cse7 .cse8) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse9) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse10 (select |v_#valid_BEFORE_CALL_7| .cse10))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0)))))) is different from true [2024-10-12 18:24:50,103 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse6 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select .cse2 4))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| (select .cse2 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3)))) (= (select .cse4 0) 0) (= (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 .cse3)) (not (let ((.cse5 (select |c_#memory_$Pointer$#1.base| (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= (select .cse5 0) (select .cse5 4)))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse7) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse8 (select |v_#valid_BEFORE_CALL_7| .cse8)))))))))))) is different from false [2024-10-12 18:24:50,106 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse6 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select .cse2 4))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| (select .cse2 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3)))) (= (select .cse4 0) 0) (= (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 .cse3)) (not (let ((.cse5 (select |c_#memory_$Pointer$#1.base| (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= (select .cse5 0) (select .cse5 4)))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse7) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse8 (select |v_#valid_BEFORE_CALL_7| .cse8)))))))))))) is different from true [2024-10-12 18:24:50,170 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select .cse2 4))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| (select .cse2 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3)))) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 .cse3)) (not (= (select (select |c_#memory_$Pointer$#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse6) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse7 (select |v_#valid_BEFORE_CALL_7| .cse7))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3)))))) is different from false [2024-10-12 18:24:50,173 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select .cse2 4))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| (select .cse2 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3)))) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 .cse3)) (not (= (select (select |c_#memory_$Pointer$#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse6) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse7 (select |v_#valid_BEFORE_CALL_7| .cse7))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3)))))) is different from true [2024-10-12 18:24:50,185 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_42 Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_42) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_#t~mem21#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_42) 0))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base|))) is different from false [2024-10-12 18:24:50,188 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_42 Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_42) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_#t~mem21#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_42) 0))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base|))) is different from true [2024-10-12 18:24:50,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:24:50,233 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2024-10-12 18:24:50,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-12 18:24:50,234 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 29 states have internal predecessors, (41), 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 29 [2024-10-12 18:24:50,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:24:50,234 INFO L225 Difference]: With dead ends: 61 [2024-10-12 18:24:50,234 INFO L226 Difference]: Without dead ends: 56 [2024-10-12 18:24:50,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 26 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=133, Invalid=898, Unknown=65, NotChecked=2210, Total=3306 [2024-10-12 18:24:50,237 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1012 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 18:24:50,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 217 Invalid, 0 Unknown, 1012 Unchecked, 0.3s Time] [2024-10-12 18:24:50,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-12 18:24:50,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-12 18:24:50,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 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-10-12 18:24:50,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2024-10-12 18:24:50,245 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 29 [2024-10-12 18:24:50,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:24:50,245 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2024-10-12 18:24:50,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 29 states have internal predecessors, (41), 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-10-12 18:24:50,246 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2024-10-12 18:24:50,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-12 18:24:50,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:24:50,246 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:24:50,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 18:24:50,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:24:50,447 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:24:50,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:24:50,448 INFO L85 PathProgramCache]: Analyzing trace with hash 2125194899, now seen corresponding path program 1 times [2024-10-12 18:24:50,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:24:50,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346293999] [2024-10-12 18:24:50,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:50,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:24:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:52,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:24:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:52,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:24:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:52,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 18:24:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:53,100 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:24:53,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:24:53,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346293999] [2024-10-12 18:24:53,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346293999] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:24:53,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842595868] [2024-10-12 18:24:53,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:53,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:24:53,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:24:53,102 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-10-12 18:24:53,103 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-10-12 18:24:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:53,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 134 conjuncts are in the unsatisfiable core [2024-10-12 18:24:53,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:24:53,443 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-10-12 18:24:53,451 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-10-12 18:24:53,738 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-12 18:24:53,738 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-10-12 18:24:53,765 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-12 18:24:53,766 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-10-12 18:24:53,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 16 treesize of output 11 [2024-10-12 18:24:53,848 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-10-12 18:24:53,858 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-10-12 18:24:53,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 18:24:53,967 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-10-12 18:24:53,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 18:24:54,205 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2024-10-12 18:24:54,206 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 331 treesize of output 251 [2024-10-12 18:24:54,216 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 223 treesize of output 195 [2024-10-12 18:24:54,243 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 103 treesize of output 38 [2024-10-12 18:24:54,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 50 [2024-10-12 18:24:54,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:54,282 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 50 treesize of output 19 [2024-10-12 18:24:54,462 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-12 18:24:54,462 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 157 treesize of output 88 [2024-10-12 18:24:54,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2024-10-12 18:24:54,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2024-10-12 18:24:54,495 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 27 treesize of output 19 [2024-10-12 18:24:54,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-12 18:24:54,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:54,811 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-12 18:24:54,812 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 165 treesize of output 102 [2024-10-12 18:24:54,832 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-10-12 18:24:54,832 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 24 treesize of output 31 [2024-10-12 18:24:54,864 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-10-12 18:24:54,865 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 2 case distinctions, treesize of input 54 treesize of output 60 [2024-10-12 18:24:54,885 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 18 treesize of output 12 [2024-10-12 18:24:54,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2024-10-12 18:24:54,966 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-12 18:24:54,967 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-10-12 18:24:55,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:55,366 INFO L349 Elim1Store]: treesize reduction 229, result has 10.5 percent of original size [2024-10-12 18:24:55,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 379 treesize of output 253 [2024-10-12 18:24:55,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:55,548 INFO L349 Elim1Store]: treesize reduction 235, result has 15.2 percent of original size [2024-10-12 18:24:55,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 1171 treesize of output 1016 [2024-10-12 18:24:55,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:55,767 INFO L349 Elim1Store]: treesize reduction 148, result has 33.0 percent of original size [2024-10-12 18:24:55,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 569 treesize of output 453 [2024-10-12 18:24:55,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:55,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:55,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:56,005 INFO L349 Elim1Store]: treesize reduction 108, result has 34.1 percent of original size [2024-10-12 18:24:56,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 631 treesize of output 537 [2024-10-12 18:24:56,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:56,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:56,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:56,201 INFO L349 Elim1Store]: treesize reduction 149, result has 19.9 percent of original size [2024-10-12 18:24:56,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 170 treesize of output 185 [2024-10-12 18:24:56,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:56,257 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-12 18:24:56,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 144 [2024-10-12 18:24:56,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2024-10-12 18:24:56,734 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-12 18:24:56,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 33 treesize of output 20 [2024-10-12 18:24:56,859 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 15 treesize of output 11 [2024-10-12 18:24:56,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 231 treesize of output 192 [2024-10-12 18:24:57,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 187 treesize of output 170 [2024-10-12 18:24:57,078 INFO L349 Elim1Store]: treesize reduction 95, result has 31.2 percent of original size [2024-10-12 18:24:57,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 198 treesize of output 149 [2024-10-12 18:24:57,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:57,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 224 treesize of output 208 [2024-10-12 18:24:57,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:57,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 24 [2024-10-12 18:24:57,165 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 17 treesize of output 15 [2024-10-12 18:24:57,172 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-10-12 18:24:57,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:57,184 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 19 treesize of output 15 [2024-10-12 18:24:57,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:57,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 20 [2024-10-12 18:24:57,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:57,235 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 11 [2024-10-12 18:24:57,241 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-10-12 18:24:57,290 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 85 treesize of output 23 [2024-10-12 18:24:57,297 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 17 treesize of output 15 [2024-10-12 18:24:57,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:57,304 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 23 treesize of output 19 [2024-10-12 18:24:57,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:57,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 20 [2024-10-12 18:24:57,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:57,349 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 11 [2024-10-12 18:24:57,358 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-10-12 18:24:57,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:57,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:24:57,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-10-12 18:25:01,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 83 [2024-10-12 18:25:01,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:01,727 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-10-12 18:25:01,727 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 121 treesize of output 96 [2024-10-12 18:25:01,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:01,734 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 11 [2024-10-12 18:25:01,738 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 21 treesize of output 15 [2024-10-12 18:25:01,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-12 18:25:01,846 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:25:01,846 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:25:02,015 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1222 Int) (v_ArrVal_1213 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_1211 (Array Int Int)) (v_ArrVal_1224 Int) (v_ArrVal_1223 Int) (v_ArrVal_1219 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse4))) (or (not (= v_ArrVal_1216 (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_1216 .cse1)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (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 (store |c_#memory_int#1| .cse0 v_ArrVal_1216) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1218) .cse2 v_ArrVal_1211) (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 (store (select |c_#memory_$Pointer$#1.base| .cse0) .cse1 v_ArrVal_1222)))) (store (store .cse3 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1217) .cse2 (store (select (store .cse3 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4) .cse0) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_1219)) .cse2) .cse4 v_ArrVal_1223))) .cse5) .cse6)) (+ 8 (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$#1.offset| .cse0 (store (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1 |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1213))) (store .cse7 .cse2 (store (select .cse7 .cse2) .cse4 v_ArrVal_1224))) .cse5) .cse6))))))))) is different from false [2024-10-12 18:25:02,037 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1222 Int) (v_ArrVal_1213 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_1211 (Array Int Int)) (v_ArrVal_1224 Int) (v_ArrVal_1223 Int) (v_ArrVal_1219 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse3)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse3))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (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 (store |c_#memory_int#1| .cse0 v_ArrVal_1216) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1218) .cse1 v_ArrVal_1211) (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 (store (select |c_#memory_$Pointer$#1.base| .cse0) .cse4 v_ArrVal_1222)))) (store (store .cse2 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1217) .cse1 (store (select (store .cse2 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (store (store (select .cse2 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4) .cse0) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_1219)) .cse1) .cse3 v_ArrVal_1223))) .cse5) .cse6)) (+ 8 (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$#1.offset| .cse0 (store (select |c_#memory_$Pointer$#1.offset| .cse0) .cse4 |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1213))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse3 v_ArrVal_1224))) .cse5) .cse6))))) (not (= v_ArrVal_1216 (store (select |c_#memory_int#1| .cse0) .cse4 (select v_ArrVal_1216 .cse4)))))))) is different from false [2024-10-12 18:25:02,139 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (v_ArrVal_1235 (Array Int Int)) (v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1211 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| Int) (v_ArrVal_1222 Int) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_1224 Int) (v_ArrVal_1223 Int) (v_ArrVal_1219 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| v_ArrVal_1234)) (.cse3 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| v_ArrVal_1233)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (select (select .cse3 .cse1) .cse5)) (.cse6 (select (select .cse10 .cse1) .cse5))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_1216) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| v_ArrVal_1218) .cse1 v_ArrVal_1211) (select (select (let ((.cse4 (store (select .cse3 .cse0) .cse6 v_ArrVal_1222))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 .cse4))) (store (store .cse2 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| v_ArrVal_1217) .cse1 (store (select (store .cse2 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| (store (store (select (store .cse3 .cse0 .cse4) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24|) (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4) .cse0) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_1219)) .cse1) .cse5 v_ArrVal_1223)))) .cse7) .cse8)) (+ 8 (select (select (let ((.cse9 (store (store |c_#memory_$Pointer$#1.offset| .cse0 (store (select .cse10 .cse0) .cse6 |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| v_ArrVal_1213))) (store .cse9 .cse1 (store (select .cse9 .cse1) .cse5 v_ArrVal_1224))) .cse7) .cse8))))) (not (= (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| v_ArrVal_1235) .cse0) .cse6 (select v_ArrVal_1216 .cse6)) v_ArrVal_1216)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24|) 0)))))) is different from false [2024-10-12 18:25:02,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842595868] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:25:02,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:25:02,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 42 [2024-10-12 18:25:02,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790747737] [2024-10-12 18:25:02,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:25:02,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-12 18:25:02,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:25:02,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-12 18:25:02,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1852, Unknown=6, NotChecked=264, Total=2256 [2024-10-12 18:25:02,148 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 42 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 32 states have internal predecessors, (44), 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-10-12 18:25:07,248 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-10-12 18:25:11,398 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-10-12 18:25:12,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:25:12,231 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2024-10-12 18:25:12,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-12 18:25:12,231 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 32 states have internal predecessors, (44), 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 29 [2024-10-12 18:25:12,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:25:12,232 INFO L225 Difference]: With dead ends: 72 [2024-10-12 18:25:12,232 INFO L226 Difference]: Without dead ends: 70 [2024-10-12 18:25:12,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=253, Invalid=3411, Unknown=8, NotChecked=360, Total=4032 [2024-10-12 18:25:12,234 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 52 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 17 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:25:12,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 227 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 798 Invalid, 4 Unknown, 0 Unchecked, 9.1s Time] [2024-10-12 18:25:12,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-12 18:25:12,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2024-10-12 18:25:12,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 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-10-12 18:25:12,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2024-10-12 18:25:12,243 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 29 [2024-10-12 18:25:12,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:25:12,243 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2024-10-12 18:25:12,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 32 states have internal predecessors, (44), 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-10-12 18:25:12,244 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2024-10-12 18:25:12,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-12 18:25:12,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:25:12,245 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:25:12,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 18:25:12,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:25:12,445 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:25:12,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:25:12,446 INFO L85 PathProgramCache]: Analyzing trace with hash 536803287, now seen corresponding path program 1 times [2024-10-12 18:25:12,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:25:12,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282242129] [2024-10-12 18:25:12,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:12,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:25:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:12,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:25:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:12,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:25:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:12,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 18:25:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:12,625 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 18:25:12,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:25:12,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282242129] [2024-10-12 18:25:12,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282242129] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:25:12,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856171915] [2024-10-12 18:25:12,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:12,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:25:12,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:25:12,627 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-10-12 18:25:12,628 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-10-12 18:25:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:12,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 18:25:12,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:25:12,811 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:25:12,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:25:12,843 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 18:25:12,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856171915] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:25:12,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:25:12,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-10-12 18:25:12,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406062892] [2024-10-12 18:25:12,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:25:12,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 18:25:12,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:25:12,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 18:25:12,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:25:12,845 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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-10-12 18:25:12,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:25:12,942 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2024-10-12 18:25:12,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 18:25:12,943 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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 29 [2024-10-12 18:25:12,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:25:12,943 INFO L225 Difference]: With dead ends: 85 [2024-10-12 18:25:12,943 INFO L226 Difference]: Without dead ends: 46 [2024-10-12 18:25:12,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 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-10-12 18:25:12,944 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 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.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:25:12,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:25:12,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-12 18:25:12,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-12 18:25:12,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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-10-12 18:25:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-10-12 18:25:12,954 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 29 [2024-10-12 18:25:12,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:25:12,954 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-10-12 18:25:12,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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-10-12 18:25:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2024-10-12 18:25:12,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-12 18:25:12,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:25:12,955 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:25:12,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 18:25:13,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:25:13,156 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:25:13,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:25:13,156 INFO L85 PathProgramCache]: Analyzing trace with hash -370873652, now seen corresponding path program 1 times [2024-10-12 18:25:13,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:25:13,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331411191] [2024-10-12 18:25:13,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:13,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:25:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:15,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:25:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:15,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:25:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:15,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 18:25:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:15,487 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:25:15,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:25:15,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331411191] [2024-10-12 18:25:15,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331411191] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:25:15,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619012157] [2024-10-12 18:25:15,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:15,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:25:15,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:25:15,490 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-10-12 18:25:15,493 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-10-12 18:25:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:15,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 156 conjuncts are in the unsatisfiable core [2024-10-12 18:25:15,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:25:15,728 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-10-12 18:25:15,909 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_dll_circular_create_~last~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) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0)))) is different from false [2024-10-12 18:25:15,911 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_dll_circular_create_~last~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) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0)))) is different from true [2024-10-12 18:25:15,924 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-10-12 18:25:15,930 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-10-12 18:25:15,955 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_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse0 (select |c_#valid| .cse0)))))) (= (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) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from false [2024-10-12 18:25:15,957 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_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse0 (select |c_#valid| .cse0)))))) (= (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) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from true [2024-10-12 18:25:15,982 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-12 18:25:15,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-12 18:25:16,018 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-12 18:25:16,019 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-10-12 18:25:16,028 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-10-12 18:25:16,033 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (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)) .cse1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |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) .cse1) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) is different from false [2024-10-12 18:25:16,036 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (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)) .cse1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |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) .cse1) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) is different from true [2024-10-12 18:25:16,072 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_dll_circular_create_~last~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|) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) is different from false [2024-10-12 18:25:16,075 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_dll_circular_create_~last~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|) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) is different from true [2024-10-12 18:25:16,141 INFO L349 Elim1Store]: treesize reduction 33, result has 45.0 percent of original size [2024-10-12 18:25:16,142 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 119 treesize of output 74 [2024-10-12 18:25:16,174 INFO L349 Elim1Store]: treesize reduction 29, result has 48.2 percent of original size [2024-10-12 18:25:16,175 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 95 treesize of output 73 [2024-10-12 18:25:16,206 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse1 (select .cse3 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_17| .cse2)))) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select .cse3 0) .cse1) (= (select .cse4 0) 0) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_append_~data#1|) (= (select .cse4 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 0) .cse2))))) is different from false [2024-10-12 18:25:16,210 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse1 (select .cse3 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_17| .cse2)))) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select .cse3 0) .cse1) (= (select .cse4 0) 0) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_append_~data#1|) (= (select .cse4 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 0) .cse2))))) is different from true [2024-10-12 18:25:16,228 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-12 18:25:16,228 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-10-12 18:25:16,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:16,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2024-10-12 18:25:16,264 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimIndex_14 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))) (and (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_14) 1)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-10-12 18:25:16,267 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimIndex_14 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))) (and (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_14) 1)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-10-12 18:25:16,309 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) (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimIndex_14 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))) (and (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_14) 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-10-12 18:25:16,311 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) (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimIndex_14 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))) (and (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_14) 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-10-12 18:25:16,322 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-10-12 18:25:16,346 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)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimIndex_14 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))) (and (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_14) 1)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#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-10-12 18:25:16,349 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)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimIndex_14 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))) (and (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_14) 1)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#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-10-12 18:25:16,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:16,398 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-12 18:25:16,398 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-10-12 18:25:16,451 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2024-10-12 18:25:16,452 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 46 treesize of output 78 [2024-10-12 18:25:16,527 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse4 4))) (and (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_old(#valid)_AFTER_CALL_18| .cse2)))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 8)) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (or (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and (= (select .cse3 0) 0) (= (select .cse3 4) 0)))) (= (select .cse4 0) .cse0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimIndex_14 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))) (and (= (select |v_#valid_BEFORE_CALL_16| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse5) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_17| .cse6 (select |v_#valid_BEFORE_CALL_16| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_14) 1)))) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1))))) is different from false [2024-10-12 18:25:16,532 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse4 4))) (and (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_old(#valid)_AFTER_CALL_18| .cse2)))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 8)) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (or (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and (= (select .cse3 0) 0) (= (select .cse3 4) 0)))) (= (select .cse4 0) .cse0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimIndex_14 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))) (and (= (select |v_#valid_BEFORE_CALL_16| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse5) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_17| .cse6 (select |v_#valid_BEFORE_CALL_16| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_14) 1)))) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1))))) is different from true [2024-10-12 18:25:16,620 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse3 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (or (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0)) (or (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and (= (select .cse2 0) 0) (= (select .cse2 4) 0)))) (= (select .cse3 0) .cse0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimIndex_14 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))) (and (= (select |v_#valid_BEFORE_CALL_16| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_17| .cse5 (select |v_#valid_BEFORE_CALL_16| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_14) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse6 (select |v_old(#valid)_AFTER_CALL_18| .cse6)))))) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8)))))) is different from false [2024-10-12 18:25:16,624 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse3 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (or (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0)) (or (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and (= (select .cse2 0) 0) (= (select .cse2 4) 0)))) (= (select .cse3 0) .cse0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimIndex_14 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))) (and (= (select |v_#valid_BEFORE_CALL_16| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_17| .cse5 (select |v_#valid_BEFORE_CALL_16| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_14) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse6 (select |v_old(#valid)_AFTER_CALL_18| .cse6)))))) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8)))))) is different from true [2024-10-12 18:25:16,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:16,846 INFO L349 Elim1Store]: treesize reduction 292, result has 26.4 percent of original size [2024-10-12 18:25:16,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 343 treesize of output 273 [2024-10-12 18:25:16,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:16,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:16,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:16,928 INFO L349 Elim1Store]: treesize reduction 254, result has 20.4 percent of original size [2024-10-12 18:25:16,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 285 treesize of output 228 [2024-10-12 18:25:16,973 INFO L349 Elim1Store]: treesize reduction 104, result has 36.2 percent of original size [2024-10-12 18:25:16,974 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 138 treesize of output 203 [2024-10-12 18:25:16,995 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 37 treesize of output 53 [2024-10-12 18:25:17,080 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-12 18:25:17,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 32 [2024-10-12 18:25:17,090 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 32 treesize of output 26 [2024-10-12 18:25:18,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:20,361 INFO L349 Elim1Store]: treesize reduction 925, result has 33.2 percent of original size [2024-10-12 18:25:20,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 768 treesize of output 818 [2024-10-12 18:25:20,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:20,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:20,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:20,888 INFO L349 Elim1Store]: treesize reduction 570, result has 21.3 percent of original size [2024-10-12 18:25:20,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 725 treesize of output 493 [2024-10-12 18:25:20,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:20,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:20,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:20,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:20,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:21,292 INFO L349 Elim1Store]: treesize reduction 474, result has 20.1 percent of original size [2024-10-12 18:25:21,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 981 treesize of output 1009 [2024-10-12 18:25:22,686 INFO L349 Elim1Store]: treesize reduction 1278, result has 36.7 percent of original size [2024-10-12 18:25:22,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 1344 treesize of output 2186 [2024-10-12 18:25:22,831 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 65 treesize of output 47 [2024-10-12 18:25:23,179 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 43 [2024-10-12 18:25:25,765 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-12 18:25:25,837 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-12 18:25:25,867 INFO L224 Elim1Store]: Index analysis took 142 ms [2024-10-12 18:25:25,981 INFO L349 Elim1Store]: treesize reduction 216, result has 16.0 percent of original size [2024-10-12 18:25:25,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 349 treesize of output 363 [2024-10-12 18:25:26,076 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-12 18:25:26,133 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-12 18:25:26,134 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-12 18:25:26,142 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-12 18:25:26,143 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-12 18:25:26,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 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 310 treesize of output 288 [2024-10-12 18:25:26,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:26,545 INFO L349 Elim1Store]: treesize reduction 38, result has 45.7 percent of original size [2024-10-12 18:25:26,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 336 treesize of output 344 [2024-10-12 18:25:27,053 INFO L349 Elim1Store]: treesize reduction 28, result has 57.6 percent of original size [2024-10-12 18:25:27,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 79 [2024-10-12 18:25:29,704 INFO L349 Elim1Store]: treesize reduction 164, result has 32.0 percent of original size [2024-10-12 18:25:29,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2750 treesize of output 2295 [2024-10-12 18:25:32,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:32,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:32,833 INFO L349 Elim1Store]: treesize reduction 35, result has 35.2 percent of original size [2024-10-12 18:25:32,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 65 [2024-10-12 18:25:33,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:33,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:33,716 INFO L349 Elim1Store]: treesize reduction 35, result has 35.2 percent of original size [2024-10-12 18:25:33,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 65 [2024-10-12 18:25:34,822 INFO L349 Elim1Store]: treesize reduction 222, result has 36.6 percent of original size [2024-10-12 18:25:34,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 1767 treesize of output 1818