./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7e1ff0e6 Calling Ultimate with: /usr/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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2c_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 01:33:08,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:33:08,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:33:08,410 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:33:08,411 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:33:08,411 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:33:08,412 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:33:08,414 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:33:08,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:33:08,415 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:33:08,416 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:33:08,420 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:33:08,420 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:33:08,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:33:08,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:33:08,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:33:08,429 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:33:08,430 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:33:08,432 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:33:08,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:33:08,434 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:33:08,435 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:33:08,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:33:08,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:33:08,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:33:08,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:33:08,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:33:08,441 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:33:08,442 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:33:08,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:33:08,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:33:08,443 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:33:08,444 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:33:08,445 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:33:08,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:33:08,446 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:33:08,446 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:33:08,446 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:33:08,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:33:08,447 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:33:08,448 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:33:08,449 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 01:33:08,471 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:33:08,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:33:08,471 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:33:08,471 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:33:08,472 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:33:08,472 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:33:08,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:33:08,472 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:33:08,473 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:33:08,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:33:08,473 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:33:08,473 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:33:08,473 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 01:33:08,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:33:08,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:33:08,473 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 01:33:08,473 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 01:33:08,473 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 01:33:08,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:33:08,474 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 01:33:08,474 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:33:08,474 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:33:08,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:33:08,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:33:08,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:33:08,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:33:08,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:33:08,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:33:08,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 01:33:08,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 01:33:08,475 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:33:08,475 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:33:08,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:33:08,475 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:33:08,475 INFO L138 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.graphml 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc [2023-02-15 01:33:08,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:33:08,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:33:08,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:33:08,730 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:33:08,730 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:33:08,731 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_append_equal.i [2023-02-15 01:33:09,812 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:33:09,998 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:33:09,999 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_equal.i [2023-02-15 01:33:10,014 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e78e64dae/f7f7338fbbf748508134243d10e1c297/FLAGeb1b90072 [2023-02-15 01:33:10,024 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e78e64dae/f7f7338fbbf748508134243d10e1c297 [2023-02-15 01:33:10,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:33:10,027 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:33:10,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:33:10,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:33:10,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:33:10,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:33:10" (1/1) ... [2023-02-15 01:33:10,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40944345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:33:10, skipping insertion in model container [2023-02-15 01:33:10,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:33:10" (1/1) ... [2023-02-15 01:33:10,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:33:10,079 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:33:10,302 WARN L237 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_equal.i[24585,24598] [2023-02-15 01:33:10,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:33:10,313 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 01:33:10,356 WARN L237 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_equal.i[24585,24598] [2023-02-15 01:33:10,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:33:10,383 INFO L208 MainTranslator]: Completed translation [2023-02-15 01:33:10,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:33:10 WrapperNode [2023-02-15 01:33:10,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:33:10,385 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 01:33:10,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 01:33:10,386 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 01:33:10,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:33:10" (1/1) ... [2023-02-15 01:33:10,415 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:33:10" (1/1) ... [2023-02-15 01:33:10,431 INFO L138 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 140 [2023-02-15 01:33:10,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 01:33:10,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 01:33:10,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 01:33:10,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 01:33:10,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:33:10" (1/1) ... [2023-02-15 01:33:10,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:33:10" (1/1) ... [2023-02-15 01:33:10,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:33:10" (1/1) ... [2023-02-15 01:33:10,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:33:10" (1/1) ... [2023-02-15 01:33:10,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:33:10" (1/1) ... [2023-02-15 01:33:10,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:33:10" (1/1) ... [2023-02-15 01:33:10,450 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:33:10" (1/1) ... [2023-02-15 01:33:10,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:33:10" (1/1) ... [2023-02-15 01:33:10,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 01:33:10,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 01:33:10,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 01:33:10,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 01:33:10,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:33:10" (1/1) ... [2023-02-15 01:33:10,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:33:10,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:33:10,492 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 01:33:10,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 01:33:10,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 01:33:10,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 01:33:10,526 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 01:33:10,526 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 01:33:10,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 01:33:10,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 01:33:10,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 01:33:10,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 01:33:10,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 01:33:10,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 01:33:10,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 01:33:10,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 01:33:10,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 01:33:10,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 01:33:10,671 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 01:33:10,672 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 01:33:10,977 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 01:33:10,988 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 01:33:10,990 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-15 01:33:10,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:33:10 BoogieIcfgContainer [2023-02-15 01:33:10,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 01:33:10,994 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 01:33:10,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 01:33:10,997 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 01:33:11,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:33:10" (1/3) ... [2023-02-15 01:33:11,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2810e881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:33:11, skipping insertion in model container [2023-02-15 01:33:11,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:33:10" (2/3) ... [2023-02-15 01:33:11,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2810e881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:33:11, skipping insertion in model container [2023-02-15 01:33:11,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:33:10" (3/3) ... [2023-02-15 01:33:11,004 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_equal.i [2023-02-15 01:33:11,016 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 01:33:11,017 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2023-02-15 01:33:11,053 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 01:33:11,058 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@1fdddfe4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 01:33:11,058 INFO L358 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2023-02-15 01:33:11,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 66 states have (on average 2.090909090909091) internal successors, (138), 126 states have internal predecessors, (138), 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) [2023-02-15 01:33:11,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 01:33:11,066 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:11,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 01:33:11,067 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:11,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:11,072 INFO L85 PathProgramCache]: Analyzing trace with hash 895333938, now seen corresponding path program 1 times [2023-02-15 01:33:11,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:11,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889935733] [2023-02-15 01:33:11,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:11,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:11,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:33:11,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:11,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889935733] [2023-02-15 01:33:11,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889935733] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:33:11,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:33:11,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:33:11,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244616276] [2023-02-15 01:33:11,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:33:11,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:33:11,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:33:11,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:33:11,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:33:11,309 INFO L87 Difference]: Start difference. First operand has 131 states, 66 states have (on average 2.090909090909091) internal successors, (138), 126 states have internal predecessors, (138), 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, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:33:11,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:33:11,423 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2023-02-15 01:33:11,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:33:11,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 01:33:11,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:33:11,430 INFO L225 Difference]: With dead ends: 128 [2023-02-15 01:33:11,430 INFO L226 Difference]: Without dead ends: 125 [2023-02-15 01:33:11,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:33:11,434 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 10 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:33:11,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 195 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:33:11,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-15 01:33:11,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2023-02-15 01:33:11,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 64 states have (on average 1.984375) internal successors, (127), 120 states have internal predecessors, (127), 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) [2023-02-15 01:33:11,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2023-02-15 01:33:11,477 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 6 [2023-02-15 01:33:11,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:33:11,477 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2023-02-15 01:33:11,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:33:11,478 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2023-02-15 01:33:11,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 01:33:11,478 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:11,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 01:33:11,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 01:33:11,480 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:11,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:11,480 INFO L85 PathProgramCache]: Analyzing trace with hash 895333939, now seen corresponding path program 1 times [2023-02-15 01:33:11,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:11,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928314276] [2023-02-15 01:33:11,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:11,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:11,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:33:11,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:11,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928314276] [2023-02-15 01:33:11,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928314276] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:33:11,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:33:11,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:33:11,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844894442] [2023-02-15 01:33:11,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:33:11,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:33:11,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:33:11,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:33:11,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:33:11,566 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:33:11,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:33:11,660 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2023-02-15 01:33:11,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:33:11,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 01:33:11,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:33:11,664 INFO L225 Difference]: With dead ends: 122 [2023-02-15 01:33:11,664 INFO L226 Difference]: Without dead ends: 122 [2023-02-15 01:33:11,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:33:11,665 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 5 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:33:11,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 197 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:33:11,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-15 01:33:11,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2023-02-15 01:33:11,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 64 states have (on average 1.9375) internal successors, (124), 117 states have internal predecessors, (124), 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) [2023-02-15 01:33:11,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2023-02-15 01:33:11,671 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 6 [2023-02-15 01:33:11,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:33:11,671 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2023-02-15 01:33:11,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:33:11,671 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2023-02-15 01:33:11,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 01:33:11,672 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:11,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:33:11,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 01:33:11,672 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:11,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:11,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1787864811, now seen corresponding path program 1 times [2023-02-15 01:33:11,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:11,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050333348] [2023-02-15 01:33:11,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:11,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:11,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:33:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:33:11,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:11,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050333348] [2023-02-15 01:33:11,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050333348] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:33:11,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:33:11,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:33:11,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87597692] [2023-02-15 01:33:11,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:33:11,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:33:11,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:33:11,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:33:11,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:33:11,784 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:33:11,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:33:11,880 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2023-02-15 01:33:11,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:33:11,880 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-02-15 01:33:11,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:33:11,882 INFO L225 Difference]: With dead ends: 133 [2023-02-15 01:33:11,882 INFO L226 Difference]: Without dead ends: 133 [2023-02-15 01:33:11,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:33:11,886 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 10 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:33:11,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 295 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:33:11,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-15 01:33:11,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 123. [2023-02-15 01:33:11,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 65 states have (on average 1.9230769230769231) internal successors, (125), 118 states have internal predecessors, (125), 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) [2023-02-15 01:33:11,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2023-02-15 01:33:11,900 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 14 [2023-02-15 01:33:11,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:33:11,900 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2023-02-15 01:33:11,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:33:11,900 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2023-02-15 01:33:11,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 01:33:11,901 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:11,901 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:33:11,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 01:33:11,901 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:11,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:11,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1282134272, now seen corresponding path program 1 times [2023-02-15 01:33:11,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:11,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334907601] [2023-02-15 01:33:11,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:11,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:12,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:33:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:12,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:33:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:12,110 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:33:12,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:12,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334907601] [2023-02-15 01:33:12,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334907601] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:33:12,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:33:12,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:33:12,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867126217] [2023-02-15 01:33:12,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:33:12,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:33:12,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:33:12,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:33:12,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:33:12,113 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:33:12,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:33:12,326 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2023-02-15 01:33:12,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:33:12,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-02-15 01:33:12,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:33:12,328 INFO L225 Difference]: With dead ends: 123 [2023-02-15 01:33:12,328 INFO L226 Difference]: Without dead ends: 123 [2023-02-15 01:33:12,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:33:12,334 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 21 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:33:12,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 400 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:33:12,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-15 01:33:12,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2023-02-15 01:33:12,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 65 states have (on average 1.9076923076923078) internal successors, (124), 117 states have internal predecessors, (124), 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) [2023-02-15 01:33:12,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2023-02-15 01:33:12,342 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 24 [2023-02-15 01:33:12,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:33:12,342 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2023-02-15 01:33:12,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:33:12,342 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2023-02-15 01:33:12,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 01:33:12,342 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:12,343 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:33:12,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 01:33:12,343 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:12,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:12,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1282134271, now seen corresponding path program 1 times [2023-02-15 01:33:12,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:12,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864530185] [2023-02-15 01:33:12,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:12,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:12,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:33:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:12,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:33:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:12,590 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:33:12,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:12,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864530185] [2023-02-15 01:33:12,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864530185] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:33:12,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:33:12,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:33:12,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131914859] [2023-02-15 01:33:12,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:33:12,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:33:12,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:33:12,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:33:12,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:33:12,597 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:33:12,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:33:12,800 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2023-02-15 01:33:12,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:33:12,800 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-02-15 01:33:12,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:33:12,801 INFO L225 Difference]: With dead ends: 122 [2023-02-15 01:33:12,801 INFO L226 Difference]: Without dead ends: 122 [2023-02-15 01:33:12,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:33:12,802 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 19 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:33:12,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 424 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:33:12,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-15 01:33:12,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2023-02-15 01:33:12,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 65 states have (on average 1.8923076923076922) internal successors, (123), 116 states have internal predecessors, (123), 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) [2023-02-15 01:33:12,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2023-02-15 01:33:12,805 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 24 [2023-02-15 01:33:12,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:33:12,805 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2023-02-15 01:33:12,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:33:12,806 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2023-02-15 01:33:12,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 01:33:12,806 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:12,806 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:33:12,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 01:33:12,806 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:12,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:12,807 INFO L85 PathProgramCache]: Analyzing trace with hash 524578273, now seen corresponding path program 1 times [2023-02-15 01:33:12,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:12,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785328117] [2023-02-15 01:33:12,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:12,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:12,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:33:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:13,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:33:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:13,078 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:33:13,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:13,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785328117] [2023-02-15 01:33:13,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785328117] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:33:13,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865376512] [2023-02-15 01:33:13,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:13,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:33:13,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:33:13,082 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) [2023-02-15 01:33:13,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 01:33:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:13,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 01:33:13,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:33:13,208 INFO L350 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 [2023-02-15 01:33:13,258 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_352 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_352))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 01:33:13,312 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:33:13,312 INFO L350 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 [2023-02-15 01:33:13,321 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-02-15 01:33:13,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:33:13,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865376512] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:33:13,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:33:13,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2023-02-15 01:33:13,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336983964] [2023-02-15 01:33:13,363 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:33:13,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 01:33:13,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:33:13,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 01:33:13,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2023-02-15 01:33:13,364 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:33:13,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:33:13,602 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2023-02-15 01:33:13,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:33:13,602 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2023-02-15 01:33:13,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:33:13,603 INFO L225 Difference]: With dead ends: 146 [2023-02-15 01:33:13,603 INFO L226 Difference]: Without dead ends: 146 [2023-02-15 01:33:13,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2023-02-15 01:33:13,604 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 99 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:33:13,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 379 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 423 Invalid, 0 Unknown, 150 Unchecked, 0.2s Time] [2023-02-15 01:33:13,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-15 01:33:13,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 126. [2023-02-15 01:33:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 69 states have (on average 1.8695652173913044) internal successors, (129), 120 states have internal predecessors, (129), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 01:33:13,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2023-02-15 01:33:13,607 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 26 [2023-02-15 01:33:13,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:33:13,607 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2023-02-15 01:33:13,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:33:13,607 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2023-02-15 01:33:13,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 01:33:13,608 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:13,608 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:33:13,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 01:33:13,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-15 01:33:13,813 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:13,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:13,813 INFO L85 PathProgramCache]: Analyzing trace with hash 524578274, now seen corresponding path program 1 times [2023-02-15 01:33:13,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:13,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345890927] [2023-02-15 01:33:13,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:13,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:13,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:33:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:14,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:33:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:14,105 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:33:14,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:14,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345890927] [2023-02-15 01:33:14,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345890927] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:33:14,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056242460] [2023-02-15 01:33:14,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:14,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:33:14,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:33:14,108 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) [2023-02-15 01:33:14,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 01:33:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:14,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 01:33:14,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:33:14,214 INFO L350 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 [2023-02-15 01:33:14,370 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_493 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_493) |c_#length|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 01:33:14,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:14,419 INFO L350 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 14 treesize of output 16 [2023-02-15 01:33:14,424 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:33:14,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:33:14,445 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-02-15 01:33:14,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:33:18,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056242460] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:33:18,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:33:18,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2023-02-15 01:33:18,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579410217] [2023-02-15 01:33:18,572 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:33:18,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 01:33:18,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:33:18,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 01:33:18,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=263, Unknown=1, NotChecked=32, Total=342 [2023-02-15 01:33:18,573 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand has 17 states, 16 states have (on average 2.625) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 01:33:19,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:33:19,130 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2023-02-15 01:33:19,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 01:33:19,131 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2023-02-15 01:33:19,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:33:19,132 INFO L225 Difference]: With dead ends: 128 [2023-02-15 01:33:19,132 INFO L226 Difference]: Without dead ends: 128 [2023-02-15 01:33:19,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=74, Invalid=391, Unknown=1, NotChecked=40, Total=506 [2023-02-15 01:33:19,132 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 14 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:33:19,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 739 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 778 Invalid, 0 Unknown, 124 Unchecked, 0.4s Time] [2023-02-15 01:33:19,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-15 01:33:19,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2023-02-15 01:33:19,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 69 states have (on average 1.855072463768116) internal successors, (128), 120 states have internal predecessors, (128), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 01:33:19,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2023-02-15 01:33:19,135 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 26 [2023-02-15 01:33:19,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:33:19,136 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2023-02-15 01:33:19,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 01:33:19,136 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2023-02-15 01:33:19,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 01:33:19,136 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:19,136 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:33:19,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 01:33:19,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-02-15 01:33:19,337 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:19,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:19,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1608700855, now seen corresponding path program 1 times [2023-02-15 01:33:19,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:19,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929958868] [2023-02-15 01:33:19,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:19,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:19,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:33:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:19,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:33:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:33:19,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:19,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929958868] [2023-02-15 01:33:19,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929958868] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:33:19,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178451743] [2023-02-15 01:33:19,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:19,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:33:19,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:33:19,441 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) [2023-02-15 01:33:19,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 01:33:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:19,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 01:33:19,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:33:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:33:19,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:33:19,649 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:33:19,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178451743] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:33:19,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:33:19,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-02-15 01:33:19,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844781681] [2023-02-15 01:33:19,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:33:19,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:33:19,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:33:19,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:33:19,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:33:19,650 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:33:19,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:33:19,769 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2023-02-15 01:33:19,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:33:19,770 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2023-02-15 01:33:19,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:33:19,771 INFO L225 Difference]: With dead ends: 127 [2023-02-15 01:33:19,771 INFO L226 Difference]: Without dead ends: 127 [2023-02-15 01:33:19,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:33:19,771 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 4 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:33:19,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 618 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:33:19,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-15 01:33:19,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2023-02-15 01:33:19,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 69 states have (on average 1.8405797101449275) internal successors, (127), 120 states have internal predecessors, (127), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 01:33:19,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2023-02-15 01:33:19,774 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 28 [2023-02-15 01:33:19,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:33:19,774 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2023-02-15 01:33:19,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:33:19,774 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2023-02-15 01:33:19,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 01:33:19,774 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:19,774 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:33:19,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 01:33:19,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:33:19,975 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:19,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:19,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1674661710, now seen corresponding path program 1 times [2023-02-15 01:33:19,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:19,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111323444] [2023-02-15 01:33:19,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:19,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:20,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:33:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:20,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:33:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:20,053 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 01:33:20,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:20,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111323444] [2023-02-15 01:33:20,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111323444] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:33:20,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428451077] [2023-02-15 01:33:20,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:20,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:33:20,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:33:20,066 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) [2023-02-15 01:33:20,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 01:33:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:20,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 01:33:20,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:33:20,180 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 01:33:20,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:33:20,192 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 01:33:20,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2023-02-15 01:33:20,207 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 01:33:20,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428451077] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:33:20,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:33:20,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2023-02-15 01:33:20,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513053534] [2023-02-15 01:33:20,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:33:20,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:33:20,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:33:20,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:33:20,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:33:20,210 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:33:20,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:33:20,358 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2023-02-15 01:33:20,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:33:20,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2023-02-15 01:33:20,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:33:20,360 INFO L225 Difference]: With dead ends: 131 [2023-02-15 01:33:20,360 INFO L226 Difference]: Without dead ends: 131 [2023-02-15 01:33:20,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:33:20,360 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 11 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:33:20,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 403 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:33:20,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-15 01:33:20,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2023-02-15 01:33:20,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 72 states have (on average 1.8333333333333333) internal successors, (132), 123 states have internal predecessors, (132), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 01:33:20,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2023-02-15 01:33:20,363 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 29 [2023-02-15 01:33:20,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:33:20,364 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2023-02-15 01:33:20,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:33:20,364 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2023-02-15 01:33:20,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 01:33:20,364 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:20,364 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:33:20,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 01:33:20,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:33:20,569 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:20,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:20,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1674661709, now seen corresponding path program 1 times [2023-02-15 01:33:20,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:20,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005696719] [2023-02-15 01:33:20,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:20,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:20,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:33:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:20,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:33:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:20,748 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:33:20,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:20,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005696719] [2023-02-15 01:33:20,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005696719] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:33:20,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646646285] [2023-02-15 01:33:20,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:20,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:33:20,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:33:20,750 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) [2023-02-15 01:33:20,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 01:33:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:20,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 01:33:20,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:33:20,965 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:33:20,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:33:20,990 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:33:20,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2023-02-15 01:33:21,098 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:33:21,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646646285] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:33:21,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:33:21,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2023-02-15 01:33:21,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211732315] [2023-02-15 01:33:21,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:33:21,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 01:33:21,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:33:21,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 01:33:21,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-02-15 01:33:21,102 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-15 01:33:21,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:33:21,323 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2023-02-15 01:33:21,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 01:33:21,324 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2023-02-15 01:33:21,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:33:21,324 INFO L225 Difference]: With dead ends: 136 [2023-02-15 01:33:21,324 INFO L226 Difference]: Without dead ends: 136 [2023-02-15 01:33:21,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-02-15 01:33:21,325 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 22 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:33:21,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1057 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:33:21,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-15 01:33:21,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 129. [2023-02-15 01:33:21,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 72 states have (on average 1.8194444444444444) internal successors, (131), 123 states have internal predecessors, (131), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 01:33:21,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2023-02-15 01:33:21,327 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 29 [2023-02-15 01:33:21,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:33:21,328 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2023-02-15 01:33:21,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-15 01:33:21,328 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2023-02-15 01:33:21,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 01:33:21,328 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:21,328 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:33:21,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 01:33:21,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-15 01:33:21,535 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:21,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:21,535 INFO L85 PathProgramCache]: Analyzing trace with hash -374905453, now seen corresponding path program 1 times [2023-02-15 01:33:21,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:21,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351458138] [2023-02-15 01:33:21,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:21,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:21,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:33:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:21,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:33:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:21,634 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:33:21,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:21,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351458138] [2023-02-15 01:33:21,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351458138] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:33:21,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:33:21,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 01:33:21,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015021671] [2023-02-15 01:33:21,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:33:21,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 01:33:21,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:33:21,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 01:33:21,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:33:21,637 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:33:21,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:33:21,835 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2023-02-15 01:33:21,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 01:33:21,835 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-02-15 01:33:21,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:33:21,836 INFO L225 Difference]: With dead ends: 129 [2023-02-15 01:33:21,836 INFO L226 Difference]: Without dead ends: 129 [2023-02-15 01:33:21,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-15 01:33:21,836 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 24 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:33:21,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 445 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:33:21,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-15 01:33:21,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2023-02-15 01:33:21,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 72 states have (on average 1.8055555555555556) internal successors, (130), 122 states have internal predecessors, (130), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 01:33:21,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2023-02-15 01:33:21,839 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 30 [2023-02-15 01:33:21,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:33:21,839 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2023-02-15 01:33:21,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:33:21,839 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2023-02-15 01:33:21,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 01:33:21,839 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:21,839 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:33:21,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 01:33:21,839 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:21,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:21,840 INFO L85 PathProgramCache]: Analyzing trace with hash -374905452, now seen corresponding path program 1 times [2023-02-15 01:33:21,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:21,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105969085] [2023-02-15 01:33:21,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:21,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:21,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:33:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:21,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:33:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:22,020 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:33:22,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:22,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105969085] [2023-02-15 01:33:22,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105969085] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:33:22,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:33:22,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 01:33:22,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260409998] [2023-02-15 01:33:22,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:33:22,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 01:33:22,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:33:22,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 01:33:22,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:33:22,022 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:33:22,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:33:22,231 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2023-02-15 01:33:22,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 01:33:22,232 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-02-15 01:33:22,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:33:22,232 INFO L225 Difference]: With dead ends: 127 [2023-02-15 01:33:22,232 INFO L226 Difference]: Without dead ends: 127 [2023-02-15 01:33:22,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-15 01:33:22,233 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 20 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:33:22,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 475 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:33:22,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-15 01:33:22,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2023-02-15 01:33:22,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 72 states have (on average 1.7916666666666667) internal successors, (129), 121 states have internal predecessors, (129), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 01:33:22,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2023-02-15 01:33:22,235 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 30 [2023-02-15 01:33:22,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:33:22,235 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2023-02-15 01:33:22,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:33:22,236 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2023-02-15 01:33:22,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 01:33:22,236 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:22,236 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:33:22,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 01:33:22,236 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:22,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:22,237 INFO L85 PathProgramCache]: Analyzing trace with hash -688454360, now seen corresponding path program 1 times [2023-02-15 01:33:22,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:22,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844764710] [2023-02-15 01:33:22,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:22,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:22,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:33:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:22,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:33:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:22,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-15 01:33:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:22,343 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-15 01:33:22,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:22,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844764710] [2023-02-15 01:33:22,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844764710] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:33:22,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105526870] [2023-02-15 01:33:22,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:22,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:33:22,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:33:22,345 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) [2023-02-15 01:33:22,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 01:33:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:22,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 01:33:22,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:33:22,504 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 01:33:22,504 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:33:22,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105526870] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:33:22,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:33:22,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-02-15 01:33:22,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900365045] [2023-02-15 01:33:22,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:33:22,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:33:22,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:33:22,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:33:22,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:33:22,506 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:33:22,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:33:22,514 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2023-02-15 01:33:22,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:33:22,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2023-02-15 01:33:22,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:33:22,515 INFO L225 Difference]: With dead ends: 115 [2023-02-15 01:33:22,515 INFO L226 Difference]: Without dead ends: 115 [2023-02-15 01:33:22,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:33:22,516 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 198 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:33:22,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 134 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:33:22,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-02-15 01:33:22,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-02-15 01:33:22,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 65 states have (on average 1.7692307692307692) internal successors, (115), 110 states have internal predecessors, (115), 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) [2023-02-15 01:33:22,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2023-02-15 01:33:22,518 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 41 [2023-02-15 01:33:22,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:33:22,519 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2023-02-15 01:33:22,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:33:22,519 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2023-02-15 01:33:22,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 01:33:22,519 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:22,519 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:33:22,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 01:33:22,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:33:22,729 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:22,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:22,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1191008248, now seen corresponding path program 1 times [2023-02-15 01:33:22,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:22,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697658325] [2023-02-15 01:33:22,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:22,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:22,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:33:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:22,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:33:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:22,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:33:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:23,019 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 01:33:23,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:23,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697658325] [2023-02-15 01:33:23,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697658325] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:33:23,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393294127] [2023-02-15 01:33:23,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:23,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:33:23,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:33:23,021 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:33:23,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 01:33:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:23,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 01:33:23,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:33:23,186 INFO L350 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 [2023-02-15 01:33:23,195 INFO L350 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 [2023-02-15 01:33:23,209 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1582 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1582))))) is different from true [2023-02-15 01:33:23,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:23,253 INFO L350 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 12 treesize of output 14 [2023-02-15 01:33:23,262 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-02-15 01:33:23,278 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:33:23,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:33:23,310 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:33:23,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:33:23,316 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 14 not checked. [2023-02-15 01:33:23,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:33:23,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393294127] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:33:23,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:33:23,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2023-02-15 01:33:23,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217386247] [2023-02-15 01:33:23,499 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:33:23,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 01:33:23,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:33:23,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 01:33:23,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=121, Unknown=2, NotChecked=46, Total=210 [2023-02-15 01:33:23,500 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 01:33:23,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:33:23,747 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2023-02-15 01:33:23,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:33:23,747 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2023-02-15 01:33:23,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:33:23,748 INFO L225 Difference]: With dead ends: 125 [2023-02-15 01:33:23,748 INFO L226 Difference]: Without dead ends: 125 [2023-02-15 01:33:23,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 69 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=162, Unknown=2, NotChecked=54, Total=272 [2023-02-15 01:33:23,748 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 260 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 250 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:33:23,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 266 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 348 Invalid, 0 Unknown, 250 Unchecked, 0.2s Time] [2023-02-15 01:33:23,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-15 01:33:23,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2023-02-15 01:33:23,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 65 states have (on average 1.646153846153846) internal successors, (107), 102 states have internal predecessors, (107), 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) [2023-02-15 01:33:23,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2023-02-15 01:33:23,750 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 43 [2023-02-15 01:33:23,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:33:23,751 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2023-02-15 01:33:23,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 01:33:23,751 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2023-02-15 01:33:23,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 01:33:23,753 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:23,753 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:33:23,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 01:33:23,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:33:23,957 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:23,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:23,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1191008247, now seen corresponding path program 1 times [2023-02-15 01:33:23,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:23,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879873515] [2023-02-15 01:33:23,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:23,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:24,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:33:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:24,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:33:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:24,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:33:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:24,385 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 01:33:24,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:24,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879873515] [2023-02-15 01:33:24,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879873515] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:33:24,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839585580] [2023-02-15 01:33:24,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:24,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:33:24,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:33:24,387 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:33:24,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 01:33:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:24,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 01:33:24,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:33:24,583 INFO L350 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 [2023-02-15 01:33:24,592 INFO L350 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 [2023-02-15 01:33:24,603 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1823 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1823) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 01:33:24,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:24,626 INFO L350 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 12 treesize of output 14 [2023-02-15 01:33:24,637 INFO L350 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 [2023-02-15 01:33:24,641 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1824 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1824))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 01:33:24,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:24,664 INFO L350 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 12 treesize of output 14 [2023-02-15 01:33:24,698 INFO L350 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 [2023-02-15 01:33:24,703 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1825 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1825) |c_#length|)))) is different from true [2023-02-15 01:33:24,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:24,727 INFO L350 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 12 treesize of output 14 [2023-02-15 01:33:24,732 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2023-02-15 01:33:24,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:33:26,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839585580] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:33:26,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:33:26,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2023-02-15 01:33:26,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891710956] [2023-02-15 01:33:26,032 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:33:26,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 01:33:26,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:33:26,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 01:33:26,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=145, Unknown=3, NotChecked=78, Total=272 [2023-02-15 01:33:26,033 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 15 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 01:33:26,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:33:26,220 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2023-02-15 01:33:26,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 01:33:26,220 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2023-02-15 01:33:26,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:33:26,221 INFO L225 Difference]: With dead ends: 117 [2023-02-15 01:33:26,221 INFO L226 Difference]: Without dead ends: 117 [2023-02-15 01:33:26,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=62, Invalid=187, Unknown=3, NotChecked=90, Total=342 [2023-02-15 01:33:26,224 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 203 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 351 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:33:26,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 104 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 210 Invalid, 0 Unknown, 351 Unchecked, 0.1s Time] [2023-02-15 01:33:26,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-15 01:33:26,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2023-02-15 01:33:26,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 65 states have (on average 1.523076923076923) internal successors, (99), 94 states have internal predecessors, (99), 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) [2023-02-15 01:33:26,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2023-02-15 01:33:26,229 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 43 [2023-02-15 01:33:26,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:33:26,229 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2023-02-15 01:33:26,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 01:33:26,229 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2023-02-15 01:33:26,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 01:33:26,231 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:26,231 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:33:26,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 01:33:26,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-15 01:33:26,435 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:26,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:26,435 INFO L85 PathProgramCache]: Analyzing trace with hash -2097625015, now seen corresponding path program 1 times [2023-02-15 01:33:26,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:26,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94664471] [2023-02-15 01:33:26,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:26,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:26,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:33:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:26,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:33:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:26,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:33:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:26,530 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 01:33:26,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:26,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94664471] [2023-02-15 01:33:26,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94664471] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:33:26,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:33:26,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:33:26,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127835641] [2023-02-15 01:33:26,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:33:26,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:33:26,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:33:26,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:33:26,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:33:26,531 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:33:26,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:33:26,660 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2023-02-15 01:33:26,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:33:26,660 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2023-02-15 01:33:26,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:33:26,661 INFO L225 Difference]: With dead ends: 113 [2023-02-15 01:33:26,661 INFO L226 Difference]: Without dead ends: 113 [2023-02-15 01:33:26,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:33:26,661 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 70 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:33:26,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 264 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:33:26,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-15 01:33:26,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2023-02-15 01:33:26,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 90 states have internal predecessors, (95), 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) [2023-02-15 01:33:26,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2023-02-15 01:33:26,663 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 45 [2023-02-15 01:33:26,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:33:26,664 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2023-02-15 01:33:26,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:33:26,664 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2023-02-15 01:33:26,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 01:33:26,664 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:26,664 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:33:26,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 01:33:26,664 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:26,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:26,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2097625014, now seen corresponding path program 1 times [2023-02-15 01:33:26,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:26,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385052473] [2023-02-15 01:33:26,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:26,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:26,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:33:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:26,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:33:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:26,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:33:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:26,836 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 01:33:26,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:26,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385052473] [2023-02-15 01:33:26,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385052473] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:33:26,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:33:26,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:33:26,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090865643] [2023-02-15 01:33:26,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:33:26,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:33:26,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:33:26,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:33:26,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:33:26,838 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:33:26,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:33:26,962 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2023-02-15 01:33:26,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:33:26,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2023-02-15 01:33:26,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:33:26,963 INFO L225 Difference]: With dead ends: 91 [2023-02-15 01:33:26,963 INFO L226 Difference]: Without dead ends: 91 [2023-02-15 01:33:26,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:33:26,963 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 69 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:33:26,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 275 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:33:26,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-15 01:33:26,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-02-15 01:33:26,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.4) internal successors, (91), 86 states have internal predecessors, (91), 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) [2023-02-15 01:33:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2023-02-15 01:33:26,965 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 45 [2023-02-15 01:33:26,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:33:26,965 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2023-02-15 01:33:26,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:33:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2023-02-15 01:33:26,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 01:33:26,966 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:26,966 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:33:26,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 01:33:26,966 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:26,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:26,966 INFO L85 PathProgramCache]: Analyzing trace with hash -601855080, now seen corresponding path program 1 times [2023-02-15 01:33:26,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:26,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097578486] [2023-02-15 01:33:26,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:26,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:27,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:33:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:27,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:33:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:27,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:33:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:27,429 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 01:33:27,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:27,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097578486] [2023-02-15 01:33:27,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097578486] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:33:27,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258032446] [2023-02-15 01:33:27,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:27,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:33:27,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:33:27,431 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:33:27,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 01:33:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:27,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-15 01:33:27,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:33:27,630 INFO L350 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 [2023-02-15 01:33:27,760 INFO L350 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 9 treesize of output 5 [2023-02-15 01:33:27,856 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2357 (Array Int Int))) (and (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2357) |c_#memory_$Pointer$.base|) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 01:33:27,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:27,878 INFO L350 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 18 [2023-02-15 01:33:27,914 INFO L321 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-02-15 01:33:27,914 INFO L350 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 23 treesize of output 24 [2023-02-15 01:33:27,951 INFO L350 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 17 treesize of output 9 [2023-02-15 01:33:27,952 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-15 01:33:27,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:33:28,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258032446] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:33:28,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:33:28,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2023-02-15 01:33:28,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245817671] [2023-02-15 01:33:28,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:33:28,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-15 01:33:28,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:33:28,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 01:33:28,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=524, Unknown=1, NotChecked=46, Total=650 [2023-02-15 01:33:28,025 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 25 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:33:28,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:33:28,524 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2023-02-15 01:33:28,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 01:33:28,524 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2023-02-15 01:33:28,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:33:28,525 INFO L225 Difference]: With dead ends: 108 [2023-02-15 01:33:28,525 INFO L226 Difference]: Without dead ends: 108 [2023-02-15 01:33:28,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=842, Unknown=1, NotChecked=60, Total=1056 [2023-02-15 01:33:28,526 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 446 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:33:28,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 455 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 663 Invalid, 0 Unknown, 93 Unchecked, 0.4s Time] [2023-02-15 01:33:28,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-15 01:33:28,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2023-02-15 01:33:28,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 85 states have internal predecessors, (90), 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) [2023-02-15 01:33:28,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2023-02-15 01:33:28,528 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 46 [2023-02-15 01:33:28,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:33:28,528 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2023-02-15 01:33:28,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:33:28,528 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2023-02-15 01:33:28,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 01:33:28,528 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:28,528 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:33:28,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 01:33:28,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-15 01:33:28,729 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:28,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:28,729 INFO L85 PathProgramCache]: Analyzing trace with hash -601855079, now seen corresponding path program 1 times [2023-02-15 01:33:28,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:28,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078720472] [2023-02-15 01:33:28,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:28,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:29,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:33:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:29,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:33:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:29,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:33:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:29,583 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:33:29,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:29,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078720472] [2023-02-15 01:33:29,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078720472] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:33:29,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619113611] [2023-02-15 01:33:29,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:29,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:33:29,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:33:29,584 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:33:29,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 01:33:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:29,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 59 conjunts are in the unsatisfiable core [2023-02-15 01:33:29,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:33:29,809 INFO L350 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 [2023-02-15 01:33:30,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-02-15 01:33:30,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-02-15 01:33:30,277 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2605 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2605) |c_#memory_$Pointer$.offset|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2604 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2604))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2599 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_2599) |c_#length|)))) is different from true [2023-02-15 01:33:30,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:30,303 INFO L350 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 31 treesize of output 31 [2023-02-15 01:33:30,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:30,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 01:33:30,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:30,312 INFO L350 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 31 treesize of output 31 [2023-02-15 01:33:30,321 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 01:33:30,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 01:33:30,379 INFO L350 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 23 treesize of output 15 [2023-02-15 01:33:30,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-02-15 01:33:30,405 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-15 01:33:30,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:33:31,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619113611] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:33:31,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:33:31,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 31 [2023-02-15 01:33:31,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723469911] [2023-02-15 01:33:31,139 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:33:31,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-15 01:33:31,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:33:31,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-15 01:33:31,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1024, Unknown=2, NotChecked=64, Total=1190 [2023-02-15 01:33:31,146 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 32 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 28 states have internal predecessors, (73), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:33:32,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:33:32,468 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2023-02-15 01:33:32,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 01:33:32,468 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 28 states have internal predecessors, (73), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2023-02-15 01:33:32,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:33:32,469 INFO L225 Difference]: With dead ends: 89 [2023-02-15 01:33:32,469 INFO L226 Difference]: Without dead ends: 89 [2023-02-15 01:33:32,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=228, Invalid=1841, Unknown=5, NotChecked=88, Total=2162 [2023-02-15 01:33:32,470 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 316 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 7 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 01:33:32,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 892 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1234 Invalid, 3 Unknown, 92 Unchecked, 0.7s Time] [2023-02-15 01:33:32,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-02-15 01:33:32,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-02-15 01:33:32,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 84 states have internal predecessors, (89), 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) [2023-02-15 01:33:32,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2023-02-15 01:33:32,472 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 46 [2023-02-15 01:33:32,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:33:32,472 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2023-02-15 01:33:32,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 28 states have internal predecessors, (73), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:33:32,472 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2023-02-15 01:33:32,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 01:33:32,473 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:32,473 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:33:32,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 01:33:32,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:33:32,679 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:32,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:32,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1437854233, now seen corresponding path program 1 times [2023-02-15 01:33:32,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:32,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739832282] [2023-02-15 01:33:32,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:32,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:33,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:33:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:33,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:33:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:33,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:33:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:33,844 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:33:33,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:33,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739832282] [2023-02-15 01:33:33,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739832282] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:33:33,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086484445] [2023-02-15 01:33:33,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:33,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:33:33,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:33:33,846 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:33:33,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 01:33:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:34,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 84 conjunts are in the unsatisfiable core [2023-02-15 01:33:34,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:33:34,087 INFO L350 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 [2023-02-15 01:33:34,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:33:34,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:34,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:33:34,455 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 14 [2023-02-15 01:33:34,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:33:34,583 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2860 (Array Int Int)) (v_ArrVal_2859 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2859) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2860)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 01:33:34,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:34,626 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:33:34,626 INFO L350 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 35 treesize of output 41 [2023-02-15 01:33:34,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:34,631 INFO L350 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 40 treesize of output 38 [2023-02-15 01:33:34,658 INFO L321 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2023-02-15 01:33:34,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 64 [2023-02-15 01:33:34,712 INFO L350 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 41 treesize of output 25 [2023-02-15 01:33:34,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:34,780 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:33:34,780 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 17 [2023-02-15 01:33:34,793 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-15 01:33:34,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:33:34,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086484445] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:33:34,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:33:34,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 33 [2023-02-15 01:33:34,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835279767] [2023-02-15 01:33:34,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:33:34,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-15 01:33:34,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:33:34,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-15 01:33:34,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1144, Unknown=1, NotChecked=68, Total=1332 [2023-02-15 01:33:34,949 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 34 states, 31 states have (on average 2.193548387096774) internal successors, (68), 30 states have internal predecessors, (68), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 01:33:36,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:33:36,493 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2023-02-15 01:33:36,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 01:33:36,493 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.193548387096774) internal successors, (68), 30 states have internal predecessors, (68), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 48 [2023-02-15 01:33:36,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:33:36,494 INFO L225 Difference]: With dead ends: 147 [2023-02-15 01:33:36,494 INFO L226 Difference]: Without dead ends: 147 [2023-02-15 01:33:36,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=320, Invalid=2233, Unknown=1, NotChecked=98, Total=2652 [2023-02-15 01:33:36,495 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 469 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 01:33:36,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1085 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1290 Invalid, 0 Unknown, 136 Unchecked, 0.8s Time] [2023-02-15 01:33:36,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-02-15 01:33:36,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 88. [2023-02-15 01:33:36,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.353846153846154) internal successors, (88), 83 states have internal predecessors, (88), 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) [2023-02-15 01:33:36,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2023-02-15 01:33:36,497 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 48 [2023-02-15 01:33:36,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:33:36,498 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2023-02-15 01:33:36,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.193548387096774) internal successors, (68), 30 states have internal predecessors, (68), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 01:33:36,498 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2023-02-15 01:33:36,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 01:33:36,498 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:36,498 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:33:36,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 01:33:36,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:33:36,708 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:36,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:36,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1437854234, now seen corresponding path program 1 times [2023-02-15 01:33:36,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:36,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493499863] [2023-02-15 01:33:36,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:36,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:37,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:33:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:37,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:33:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:37,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:33:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:33:38,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:38,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493499863] [2023-02-15 01:33:38,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493499863] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:33:38,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427587204] [2023-02-15 01:33:38,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:38,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:33:38,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:33:38,595 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:33:38,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 01:33:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:38,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 97 conjunts are in the unsatisfiable core [2023-02-15 01:33:38,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:33:38,875 INFO L350 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 [2023-02-15 01:33:39,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:33:39,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:33:39,336 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:33:39,337 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 32 [2023-02-15 01:33:39,346 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:33:39,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2023-02-15 01:33:39,539 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3117 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3117))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_3111 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_3111) |c_#length|)) (exists ((v_ArrVal_3116 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3116) |c_#memory_$Pointer$.offset|)))) is different from true [2023-02-15 01:33:39,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:39,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:39,573 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 01:33:39,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 47 [2023-02-15 01:33:39,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:39,579 INFO L350 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 30 treesize of output 32 [2023-02-15 01:33:39,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:39,587 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:33:39,587 INFO L350 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 63 treesize of output 59 [2023-02-15 01:33:39,599 INFO L321 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2023-02-15 01:33:39,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 01:33:39,707 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:33:39,708 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:33:39,709 INFO L350 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 3 case distinctions, treesize of input 69 treesize of output 41 [2023-02-15 01:33:39,714 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2023-02-15 01:33:39,715 INFO L350 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 3 case distinctions, treesize of input 39 treesize of output 25 [2023-02-15 01:33:39,775 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-15 01:33:39,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:33:41,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427587204] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:33:41,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:33:41,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 44 [2023-02-15 01:33:41,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116847135] [2023-02-15 01:33:41,512 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:33:41,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-02-15 01:33:41,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:33:41,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-02-15 01:33:41,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2196, Unknown=2, NotChecked=94, Total=2450 [2023-02-15 01:33:41,514 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 45 states, 41 states have (on average 2.024390243902439) internal successors, (83), 40 states have internal predecessors, (83), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:33:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:33:43,924 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2023-02-15 01:33:43,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 01:33:43,925 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 2.024390243902439) internal successors, (83), 40 states have internal predecessors, (83), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2023-02-15 01:33:43,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:33:43,925 INFO L225 Difference]: With dead ends: 130 [2023-02-15 01:33:43,925 INFO L226 Difference]: Without dead ends: 130 [2023-02-15 01:33:43,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=346, Invalid=3946, Unknown=2, NotChecked=128, Total=4422 [2023-02-15 01:33:43,926 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 226 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 2398 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1913 SdHoareTripleChecker+Invalid, 2493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:33:43,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1913 Invalid, 2493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2398 Invalid, 0 Unknown, 90 Unchecked, 1.3s Time] [2023-02-15 01:33:43,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-02-15 01:33:43,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 87. [2023-02-15 01:33:43,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 82 states have internal predecessors, (87), 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) [2023-02-15 01:33:43,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2023-02-15 01:33:43,929 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 48 [2023-02-15 01:33:43,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:33:43,929 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2023-02-15 01:33:43,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 2.024390243902439) internal successors, (83), 40 states have internal predecessors, (83), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:33:43,929 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2023-02-15 01:33:43,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 01:33:43,929 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:43,929 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:33:43,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 01:33:44,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-02-15 01:33:44,130 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:44,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:44,130 INFO L85 PathProgramCache]: Analyzing trace with hash -2081433199, now seen corresponding path program 1 times [2023-02-15 01:33:44,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:44,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154620090] [2023-02-15 01:33:44,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:44,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:44,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:33:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:44,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:33:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:44,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:33:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:44,321 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 01:33:44,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:44,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154620090] [2023-02-15 01:33:44,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154620090] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:33:44,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:33:44,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 01:33:44,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793518832] [2023-02-15 01:33:44,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:33:44,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 01:33:44,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:33:44,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 01:33:44,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 01:33:44,323 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:33:44,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:33:44,519 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2023-02-15 01:33:44,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 01:33:44,520 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2023-02-15 01:33:44,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:33:44,520 INFO L225 Difference]: With dead ends: 150 [2023-02-15 01:33:44,520 INFO L226 Difference]: Without dead ends: 150 [2023-02-15 01:33:44,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-02-15 01:33:44,521 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 264 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:33:44,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 380 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:33:44,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-15 01:33:44,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 90. [2023-02-15 01:33:44,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.318840579710145) internal successors, (91), 85 states have internal predecessors, (91), 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) [2023-02-15 01:33:44,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2023-02-15 01:33:44,523 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 51 [2023-02-15 01:33:44,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:33:44,523 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2023-02-15 01:33:44,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:33:44,523 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2023-02-15 01:33:44,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 01:33:44,523 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:44,523 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:33:44,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-15 01:33:44,523 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:44,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:44,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2081433198, now seen corresponding path program 1 times [2023-02-15 01:33:44,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:44,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322204010] [2023-02-15 01:33:44,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:44,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:44,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:33:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:44,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:33:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:44,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:33:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:44,850 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 01:33:44,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:44,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322204010] [2023-02-15 01:33:44,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322204010] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:33:44,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:33:44,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 01:33:44,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553824977] [2023-02-15 01:33:44,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:33:44,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 01:33:44,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:33:44,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 01:33:44,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-02-15 01:33:44,852 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:33:45,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:33:45,080 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2023-02-15 01:33:45,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 01:33:45,080 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2023-02-15 01:33:45,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:33:45,081 INFO L225 Difference]: With dead ends: 132 [2023-02-15 01:33:45,081 INFO L226 Difference]: Without dead ends: 132 [2023-02-15 01:33:45,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-02-15 01:33:45,081 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 167 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:33:45,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 429 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:33:45,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-02-15 01:33:45,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 92. [2023-02-15 01:33:45,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 87 states have internal predecessors, (93), 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) [2023-02-15 01:33:45,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2023-02-15 01:33:45,083 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 51 [2023-02-15 01:33:45,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:33:45,084 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2023-02-15 01:33:45,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:33:45,084 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2023-02-15 01:33:45,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 01:33:45,084 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:45,084 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:33:45,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-15 01:33:45,084 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:45,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:45,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1197458036, now seen corresponding path program 1 times [2023-02-15 01:33:45,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:45,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197310067] [2023-02-15 01:33:45,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:45,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:45,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:33:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:45,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:33:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:45,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:33:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:45,454 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:33:45,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:45,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197310067] [2023-02-15 01:33:45,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197310067] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:33:45,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350975576] [2023-02-15 01:33:45,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:45,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:33:45,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:33:45,456 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:33:45,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 01:33:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:45,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-15 01:33:45,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:33:45,861 INFO L350 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 17 treesize of output 9 [2023-02-15 01:33:45,921 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3729 (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3729)))) is different from true [2023-02-15 01:33:45,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:45,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-02-15 01:33:45,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 01:33:45,977 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-15 01:33:45,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:33:46,036 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_68| Int) (v_ArrVal_3734 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_68| v_ArrVal_3734) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (<= (+ .cse0 1) 0) (<= 1 .cse0) (not (< |v_node_create_~temp~0#1.base_68| |c_#StackHeapBarrier|))))) is different from false [2023-02-15 01:33:46,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350975576] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:33:46,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:33:46,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2023-02-15 01:33:46,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145746650] [2023-02-15 01:33:46,037 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:33:46,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 01:33:46,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:33:46,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 01:33:46,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=571, Unknown=2, NotChecked=98, Total=756 [2023-02-15 01:33:46,038 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 26 states, 24 states have (on average 2.875) internal successors, (69), 22 states have internal predecessors, (69), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:33:46,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:33:46,492 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2023-02-15 01:33:46,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 01:33:46,493 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.875) internal successors, (69), 22 states have internal predecessors, (69), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 53 [2023-02-15 01:33:46,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:33:46,493 INFO L225 Difference]: With dead ends: 83 [2023-02-15 01:33:46,493 INFO L226 Difference]: Without dead ends: 83 [2023-02-15 01:33:46,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 54 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=901, Unknown=2, NotChecked=126, Total=1190 [2023-02-15 01:33:46,494 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 323 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:33:46,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 653 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 506 Invalid, 0 Unknown, 85 Unchecked, 0.3s Time] [2023-02-15 01:33:46,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-15 01:33:46,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-02-15 01:33:46,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 78 states have internal predecessors, (82), 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) [2023-02-15 01:33:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2023-02-15 01:33:46,496 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 53 [2023-02-15 01:33:46,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:33:46,496 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2023-02-15 01:33:46,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.875) internal successors, (69), 22 states have internal predecessors, (69), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:33:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2023-02-15 01:33:46,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-15 01:33:46,496 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:46,496 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:33:46,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 01:33:46,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-02-15 01:33:46,703 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:46,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:46,703 INFO L85 PathProgramCache]: Analyzing trace with hash -422730206, now seen corresponding path program 1 times [2023-02-15 01:33:46,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:46,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641662782] [2023-02-15 01:33:46,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:46,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:47,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:33:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:47,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:33:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:47,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:33:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:47,422 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 01:33:47,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:47,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641662782] [2023-02-15 01:33:47,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641662782] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:33:47,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:33:47,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-02-15 01:33:47,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864684092] [2023-02-15 01:33:47,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:33:47,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 01:33:47,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:33:47,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 01:33:47,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2023-02-15 01:33:47,424 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 18 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:33:47,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:33:47,749 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2023-02-15 01:33:47,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 01:33:47,750 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2023-02-15 01:33:47,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:33:47,750 INFO L225 Difference]: With dead ends: 100 [2023-02-15 01:33:47,751 INFO L226 Difference]: Without dead ends: 100 [2023-02-15 01:33:47,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2023-02-15 01:33:47,751 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 352 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:33:47,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 416 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:33:47,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-15 01:33:47,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2023-02-15 01:33:47,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 77 states have internal predecessors, (81), 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) [2023-02-15 01:33:47,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2023-02-15 01:33:47,753 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 54 [2023-02-15 01:33:47,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:33:47,753 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2023-02-15 01:33:47,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:33:47,753 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2023-02-15 01:33:47,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-15 01:33:47,753 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:47,753 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:33:47,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-02-15 01:33:47,754 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:47,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:47,754 INFO L85 PathProgramCache]: Analyzing trace with hash -422730205, now seen corresponding path program 1 times [2023-02-15 01:33:47,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:47,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187341390] [2023-02-15 01:33:47,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:47,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:48,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:33:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:48,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:33:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:48,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:33:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:49,263 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:33:49,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:49,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187341390] [2023-02-15 01:33:49,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187341390] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:33:49,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849211813] [2023-02-15 01:33:49,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:49,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:33:49,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:33:49,264 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:33:49,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 01:33:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:49,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 58 conjunts are in the unsatisfiable core [2023-02-15 01:33:49,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:33:49,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:33:49,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:49,889 INFO L350 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 14 treesize of output 16 [2023-02-15 01:33:50,107 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 01:33:50,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2023-02-15 01:33:50,122 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 01:33:50,123 INFO L350 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 33 [2023-02-15 01:33:50,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:50,223 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 01:33:50,224 INFO L350 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 29 treesize of output 38 [2023-02-15 01:33:50,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:50,236 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 01:33:50,237 INFO L350 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 47 treesize of output 52 [2023-02-15 01:33:50,252 INFO L350 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 [2023-02-15 01:33:50,260 INFO L350 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 [2023-02-15 01:33:50,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:50,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 01:33:50,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:50,371 INFO L350 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 29 treesize of output 29 [2023-02-15 01:33:50,451 INFO L350 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 23 treesize of output 15 [2023-02-15 01:33:50,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-02-15 01:33:50,500 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 01:33:50,500 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:33:50,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849211813] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:33:50,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:33:50,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [21] total 39 [2023-02-15 01:33:50,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910066395] [2023-02-15 01:33:50,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:33:50,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 01:33:50,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:33:50,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 01:33:50,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1436, Unknown=5, NotChecked=0, Total=1560 [2023-02-15 01:33:50,501 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 20 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:33:51,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:33:51,398 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2023-02-15 01:33:51,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 01:33:51,398 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2023-02-15 01:33:51,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:33:51,399 INFO L225 Difference]: With dead ends: 81 [2023-02-15 01:33:51,399 INFO L226 Difference]: Without dead ends: 81 [2023-02-15 01:33:51,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=288, Invalid=2463, Unknown=5, NotChecked=0, Total=2756 [2023-02-15 01:33:51,400 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 431 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 21 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:33:51,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 373 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 483 Invalid, 3 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 01:33:51,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-15 01:33:51,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-02-15 01:33:51,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 76 states have internal predecessors, (80), 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) [2023-02-15 01:33:51,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2023-02-15 01:33:51,402 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 54 [2023-02-15 01:33:51,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:33:51,402 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2023-02-15 01:33:51,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:33:51,402 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2023-02-15 01:33:51,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 01:33:51,402 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:51,403 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:33:51,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-15 01:33:51,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:33:51,609 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:51,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:51,609 INFO L85 PathProgramCache]: Analyzing trace with hash -755022309, now seen corresponding path program 1 times [2023-02-15 01:33:51,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:51,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980688824] [2023-02-15 01:33:51,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:51,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:52,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:33:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:52,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:33:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:52,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:33:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:52,483 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 01:33:52,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:52,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980688824] [2023-02-15 01:33:52,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980688824] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:33:52,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825757277] [2023-02-15 01:33:52,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:52,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:33:52,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:33:52,489 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:33:52,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-15 01:33:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:52,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-15 01:33:52,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:33:53,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:33:53,050 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4458 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4458)))) is different from true [2023-02-15 01:33:53,054 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4459 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4459)))) is different from true [2023-02-15 01:33:53,058 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4460 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4460)))) is different from true [2023-02-15 01:33:53,063 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4460 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_4460) |c_#memory_$Pointer$.base|))) is different from true [2023-02-15 01:33:53,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:53,071 INFO L350 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 18 [2023-02-15 01:33:53,196 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 01:33:53,196 INFO L350 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 21 treesize of output 28 [2023-02-15 01:33:53,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:53,260 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 01:33:53,260 INFO L350 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 23 treesize of output 32 [2023-02-15 01:33:53,265 INFO L350 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 [2023-02-15 01:33:53,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:53,279 INFO L350 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 18 [2023-02-15 01:33:53,352 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:33:53,353 INFO L350 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 29 treesize of output 30 [2023-02-15 01:33:53,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-02-15 01:33:53,394 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-02-15 01:33:53,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:33:53,408 INFO L321 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2023-02-15 01:33:53,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-02-15 01:33:53,411 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4465 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_4465) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from false [2023-02-15 01:33:53,535 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (v_ArrVal_4464 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4465 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4464))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_4465) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 01:33:53,552 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (v_ArrVal_4464 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4465 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4464))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_4465) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse1)))) is different from false [2023-02-15 01:33:53,595 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (v_ArrVal_4464 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4465 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| Int) (v_ArrVal_4470 (Array Int Int))) (or (not (< |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| |c_#StackHeapBarrier|)) (let ((.cse0 (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| v_ArrVal_4470))) (store .cse2 |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select .cse2 |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24|))) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| v_ArrVal_4464))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_4465) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse1))))) is different from false [2023-02-15 01:33:53,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825757277] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:33:53,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:33:53,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 40 [2023-02-15 01:33:53,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005081880] [2023-02-15 01:33:53,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:33:53,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-15 01:33:53,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:33:53,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-15 01:33:53,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1334, Unknown=47, NotChecked=648, Total=2162 [2023-02-15 01:33:53,599 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 41 states, 38 states have (on average 2.5) internal successors, (95), 35 states have internal predecessors, (95), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:33:54,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:33:54,887 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2023-02-15 01:33:54,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 01:33:54,887 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 2.5) internal successors, (95), 35 states have internal predecessors, (95), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 59 [2023-02-15 01:33:54,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:33:54,888 INFO L225 Difference]: With dead ends: 103 [2023-02-15 01:33:54,888 INFO L226 Difference]: Without dead ends: 103 [2023-02-15 01:33:54,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=438, Invalid=2733, Unknown=53, NotChecked=936, Total=4160 [2023-02-15 01:33:54,889 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 705 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 351 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 01:33:54,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 750 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1228 Invalid, 0 Unknown, 351 Unchecked, 0.5s Time] [2023-02-15 01:33:54,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-15 01:33:54,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2023-02-15 01:33:54,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 77 states have internal predecessors, (82), 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) [2023-02-15 01:33:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2023-02-15 01:33:54,891 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 59 [2023-02-15 01:33:54,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:33:54,891 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2023-02-15 01:33:54,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 2.5) internal successors, (95), 35 states have internal predecessors, (95), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:33:54,891 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2023-02-15 01:33:54,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 01:33:54,891 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:33:54,892 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:33:54,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-15 01:33:55,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-15 01:33:55,097 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:33:55,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:33:55,097 INFO L85 PathProgramCache]: Analyzing trace with hash -755022308, now seen corresponding path program 1 times [2023-02-15 01:33:55,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:33:55,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151875474] [2023-02-15 01:33:55,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:55,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:33:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:56,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:33:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:56,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:33:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:56,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:33:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:57,136 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:33:57,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:33:57,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151875474] [2023-02-15 01:33:57,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151875474] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:33:57,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351927853] [2023-02-15 01:33:57,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:33:57,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:33:57,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:33:57,138 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:33:57,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-15 01:33:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:33:57,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 132 conjunts are in the unsatisfiable core [2023-02-15 01:33:57,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:33:57,410 INFO L350 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 [2023-02-15 01:33:57,467 INFO L350 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 [2023-02-15 01:33:57,558 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:33:57,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:33:57,632 INFO L350 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 [2023-02-15 01:33:57,637 INFO L350 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 [2023-02-15 01:33:57,993 INFO L350 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 13 treesize of output 9 [2023-02-15 01:33:58,173 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:33:58,173 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 21 [2023-02-15 01:33:58,176 INFO L350 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 [2023-02-15 01:33:58,191 INFO L350 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 [2023-02-15 01:33:58,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:33:58,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:58,587 INFO L350 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 14 treesize of output 16 [2023-02-15 01:33:58,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:58,602 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:33:58,602 INFO L350 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 46 treesize of output 48 [2023-02-15 01:33:58,615 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 01:33:58,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2023-02-15 01:33:58,628 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 01:33:58,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 01:33:59,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:59,081 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:33:59,111 INFO L321 Elim1Store]: treesize reduction 88, result has 30.2 percent of original size [2023-02-15 01:33:59,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 117 treesize of output 83 [2023-02-15 01:33:59,119 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 45 [2023-02-15 01:33:59,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:59,281 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-02-15 01:33:59,282 INFO L350 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 100 treesize of output 92 [2023-02-15 01:33:59,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:59,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:59,301 INFO L321 Elim1Store]: treesize reduction 63, result has 28.4 percent of original size [2023-02-15 01:33:59,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 91 [2023-02-15 01:33:59,342 INFO L350 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 [2023-02-15 01:33:59,375 INFO L350 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 [2023-02-15 01:33:59,378 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:33:59,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:59,562 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-02-15 01:33:59,562 INFO L350 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 88 treesize of output 82 [2023-02-15 01:33:59,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:59,579 INFO L321 Elim1Store]: treesize reduction 43, result has 36.8 percent of original size [2023-02-15 01:33:59,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 76 [2023-02-15 01:33:59,601 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:33:59,613 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:33:59,892 INFO L321 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2023-02-15 01:33:59,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 135 treesize of output 108 [2023-02-15 01:33:59,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:33:59,921 INFO L321 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2023-02-15 01:33:59,921 INFO L350 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 70 treesize of output 85 [2023-02-15 01:33:59,954 INFO L350 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 [2023-02-15 01:33:59,978 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:33:59,980 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:33:59,992 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:33:59,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 68 [2023-02-15 01:34:00,009 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:34:00,011 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:34:00,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-02-15 01:34:00,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:34:00,193 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:34:00,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:34:00,370 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4772 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4771 (Array Int Int)) (v_ArrVal_4772 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_4771) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 01:34:00,377 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (forall ((v_ArrVal_4771 (Array Int Int)) (v_ArrVal_4772 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4771) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_4772 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-02-15 01:34:00,390 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (v_ArrVal_4769 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4771 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (v_ArrVal_4769 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) .cse0 v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_4771) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2023-02-15 01:34:00,410 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|))) (and (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (store .cse0 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4771 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (store .cse0 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) .cse2 v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4771) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-02-15 01:34:00,422 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base|))) (and (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (store .cse0 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4771 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (store .cse0 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) .cse2 v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4771) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-02-15 01:34:00,435 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4)))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse2 (select |c_#memory_$Pointer$.base| .cse0))) (and (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse2 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4771 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse2 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) .cse3 v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_4771) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) is different from false [2023-02-15 01:34:00,464 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse2 (select |c_#memory_$Pointer$.base| .cse0))) (and (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse2 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4771 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse2 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) .cse3 v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_4771) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) is different from false [2023-02-15 01:34:00,496 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse2 (select |c_#memory_$Pointer$.base| .cse0))) (and (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4770) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse2 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4769) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4771 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse2 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4769))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ 12 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4770) .cse3 v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_4771) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) is different from false [2023-02-15 01:34:01,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351927853] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:34:01,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:34:01,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 31] total 54 [2023-02-15 01:34:01,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095415393] [2023-02-15 01:34:01,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:34:01,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-02-15 01:34:01,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:34:01,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-02-15 01:34:01,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=3241, Unknown=9, NotChecked=968, Total=4422 [2023-02-15 01:34:01,122 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 55 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 47 states have internal predecessors, (105), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 01:34:05,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:34:05,598 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2023-02-15 01:34:05,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-15 01:34:05,599 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 47 states have internal predecessors, (105), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 59 [2023-02-15 01:34:05,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:34:05,599 INFO L225 Difference]: With dead ends: 105 [2023-02-15 01:34:05,599 INFO L226 Difference]: Without dead ends: 105 [2023-02-15 01:34:05,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=597, Invalid=6067, Unknown=10, NotChecked=1336, Total=8010 [2023-02-15 01:34:05,601 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 874 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 1979 mSolverCounterSat, 32 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1979 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:34:05,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 941 Invalid, 2013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1979 Invalid, 2 Unknown, 0 Unchecked, 1.2s Time] [2023-02-15 01:34:05,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-15 01:34:05,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2023-02-15 01:34:05,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 79 states have internal predecessors, (84), 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) [2023-02-15 01:34:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2023-02-15 01:34:05,603 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 59 [2023-02-15 01:34:05,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:34:05,603 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2023-02-15 01:34:05,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 47 states have internal predecessors, (105), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 01:34:05,603 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2023-02-15 01:34:05,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-15 01:34:05,603 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:34:05,603 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:34:05,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-15 01:34:05,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-02-15 01:34:05,804 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:34:05,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:34:05,804 INFO L85 PathProgramCache]: Analyzing trace with hash 273036414, now seen corresponding path program 1 times [2023-02-15 01:34:05,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:34:05,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177587904] [2023-02-15 01:34:05,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:05,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:34:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:07,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:34:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:07,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:34:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:08,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:34:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:08,662 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:34:08,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:34:08,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177587904] [2023-02-15 01:34:08,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177587904] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:34:08,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929032045] [2023-02-15 01:34:08,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:08,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:34:08,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:34:08,663 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:34:08,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-15 01:34:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:08,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 154 conjunts are in the unsatisfiable core [2023-02-15 01:34:08,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:34:08,958 INFO L350 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 [2023-02-15 01:34:09,005 INFO L350 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 [2023-02-15 01:34:09,127 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:34:09,127 INFO L350 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 [2023-02-15 01:34:09,246 INFO L350 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 11 treesize of output 7 [2023-02-15 01:34:09,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:34:09,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:09,457 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:34:09,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2023-02-15 01:34:09,613 INFO L350 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 19 treesize of output 18 [2023-02-15 01:34:09,661 INFO L350 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 14 treesize of output 16 [2023-02-15 01:34:09,839 INFO L350 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 14 treesize of output 16 [2023-02-15 01:34:09,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:09,855 INFO L350 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 21 treesize of output 20 [2023-02-15 01:34:09,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:34:10,115 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:34:10,115 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 32 [2023-02-15 01:34:10,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:10,120 INFO L350 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 16 treesize of output 10 [2023-02-15 01:34:10,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:34:10,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:34:10,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:10,568 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:34:10,568 INFO L350 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 77 treesize of output 65 [2023-02-15 01:34:10,581 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 01:34:10,582 INFO L350 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 18 treesize of output 28 [2023-02-15 01:34:10,588 INFO L350 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 [2023-02-15 01:34:10,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:10,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:10,603 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 01:34:10,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-02-15 01:34:10,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:10,613 INFO L350 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 14 treesize of output 16 [2023-02-15 01:34:11,176 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2023-02-15 01:34:11,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 129 treesize of output 110 [2023-02-15 01:34:11,189 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:34:11,189 INFO L350 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 48 treesize of output 49 [2023-02-15 01:34:11,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:11,195 INFO L350 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 32 treesize of output 34 [2023-02-15 01:34:11,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:11,213 INFO L350 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 14 treesize of output 16 [2023-02-15 01:34:11,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:11,229 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:34:11,229 INFO L350 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 63 [2023-02-15 01:34:11,235 INFO L350 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 18 treesize of output 20 [2023-02-15 01:34:11,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:11,280 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:34:11,280 INFO L350 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 63 [2023-02-15 01:34:11,289 INFO L350 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 18 treesize of output 20 [2023-02-15 01:34:11,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:11,294 INFO L350 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 14 treesize of output 16 [2023-02-15 01:34:11,468 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:34:11,468 INFO L350 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 75 [2023-02-15 01:34:11,472 INFO L350 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 13 [2023-02-15 01:34:11,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:11,476 INFO L350 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 37 treesize of output 32 [2023-02-15 01:34:11,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:11,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 01:34:11,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-02-15 01:34:11,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:34:11,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:34:11,720 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:34:11,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:34:11,966 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5097 Int) (v_ArrVal_5099 (Array Int Int)) (v_ArrVal_5100 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_5097)) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5099) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5100) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-02-15 01:34:11,975 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5097 Int) (v_ArrVal_5099 (Array Int Int)) (v_ArrVal_5100 (Array Int Int)) (v_ArrVal_5095 (Array Int Int)) (v_ArrVal_5094 (Array Int Int)) (v_ArrVal_5096 (Array Int Int))) (= (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5095))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5096)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5094))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_5097))) (select (select (store .cse3 .cse1 v_ArrVal_5099) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store .cse2 .cse1 v_ArrVal_5100) |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 [2023-02-15 01:34:11,992 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5088 (Array Int Int)) (v_ArrVal_5097 Int) (v_ArrVal_5099 (Array Int Int)) (v_ArrVal_5089 (Array Int Int)) (v_ArrVal_5100 (Array Int Int)) (v_ArrVal_5090 (Array Int Int)) (v_ArrVal_5095 (Array Int Int)) (v_ArrVal_5094 (Array Int Int)) (v_ArrVal_5096 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5089) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5095))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5090) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5096)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5088) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5094))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_5097))) (select (select (store .cse3 .cse1 v_ArrVal_5099) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse2 .cse1 v_ArrVal_5100) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))) is different from false [2023-02-15 01:34:12,000 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5088 (Array Int Int)) (v_ArrVal_5097 Int) (v_ArrVal_5099 (Array Int Int)) (v_ArrVal_5089 (Array Int Int)) (v_ArrVal_5100 (Array Int Int)) (v_ArrVal_5090 (Array Int Int)) (v_ArrVal_5095 (Array Int Int)) (v_ArrVal_5094 (Array Int Int)) (v_ArrVal_5096 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_5089) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5095))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_5090) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5096)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_5088) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5094))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_5097))) (select (select (store .cse3 .cse1 v_ArrVal_5099) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse2 .cse1 v_ArrVal_5100) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))) is different from false [2023-02-15 01:34:12,011 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5088 (Array Int Int)) (v_ArrVal_5097 Int) (v_ArrVal_5099 (Array Int Int)) (v_ArrVal_5089 (Array Int Int)) (v_ArrVal_5100 (Array Int Int)) (v_ArrVal_5090 (Array Int Int)) (v_ArrVal_5095 (Array Int Int)) (v_ArrVal_5094 (Array Int Int)) (v_ArrVal_5096 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_5089) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5095))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_5090) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5096)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| .cse3 v_ArrVal_5088) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5094))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 4 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) v_ArrVal_5097))) (select (select (store .cse4 .cse1 v_ArrVal_5099) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse2 .cse1 v_ArrVal_5100) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))))) is different from false [2023-02-15 01:34:12,020 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5088 (Array Int Int)) (v_ArrVal_5097 Int) (v_ArrVal_5099 (Array Int Int)) (v_ArrVal_5089 (Array Int Int)) (v_ArrVal_5100 (Array Int Int)) (v_ArrVal_5090 (Array Int Int)) (v_ArrVal_5095 (Array Int Int)) (v_ArrVal_5094 (Array Int Int)) (v_ArrVal_5096 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_5089) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5095))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_5090) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5096)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| .cse3 v_ArrVal_5088) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5094))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_5097))) (select (select (store .cse4 .cse1 v_ArrVal_5099) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse2 .cse1 v_ArrVal_5100) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))))) is different from false [2023-02-15 01:34:12,044 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5088 (Array Int Int)) (v_ArrVal_5097 Int) (v_ArrVal_5099 (Array Int Int)) (v_ArrVal_5089 (Array Int Int)) (v_ArrVal_5100 (Array Int Int)) (v_ArrVal_5090 (Array Int Int)) (v_ArrVal_5095 (Array Int Int)) (v_ArrVal_5094 (Array Int Int)) (v_ArrVal_5096 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_5089) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5095))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_5090) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5096)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| .cse3 v_ArrVal_5088) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5094))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_5097))) (select (select (store .cse4 .cse1 v_ArrVal_5099) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse2 .cse1 v_ArrVal_5100) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))))) is different from false [2023-02-15 01:34:12,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929032045] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:34:12,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:34:12,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 33] total 69 [2023-02-15 01:34:12,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236302752] [2023-02-15 01:34:12,839 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:34:12,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-02-15 01:34:12,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:34:12,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-02-15 01:34:12,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=4950, Unknown=36, NotChecked=1036, Total=6320 [2023-02-15 01:34:12,842 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 69 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 60 states have internal predecessors, (108), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:34:16,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:34:16,876 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2023-02-15 01:34:16,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-15 01:34:16,876 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 60 states have internal predecessors, (108), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 61 [2023-02-15 01:34:16,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:34:16,877 INFO L225 Difference]: With dead ends: 103 [2023-02-15 01:34:16,877 INFO L226 Difference]: Without dead ends: 103 [2023-02-15 01:34:16,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2064 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=769, Invalid=8534, Unknown=37, NotChecked=1372, Total=10712 [2023-02-15 01:34:16,879 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 601 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 2204 mSolverCounterSat, 34 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 2240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2204 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:34:16,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 1112 Invalid, 2240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2204 Invalid, 2 Unknown, 0 Unchecked, 1.2s Time] [2023-02-15 01:34:16,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-15 01:34:16,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 84. [2023-02-15 01:34:16,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 79 states have internal predecessors, (83), 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) [2023-02-15 01:34:16,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2023-02-15 01:34:16,881 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 61 [2023-02-15 01:34:16,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:34:16,881 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2023-02-15 01:34:16,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 60 states have internal predecessors, (108), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:34:16,882 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2023-02-15 01:34:16,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-15 01:34:16,882 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:34:16,882 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:34:16,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-02-15 01:34:17,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-15 01:34:17,089 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:34:17,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:34:17,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1627638346, now seen corresponding path program 1 times [2023-02-15 01:34:17,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:34:17,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239303828] [2023-02-15 01:34:17,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:17,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:34:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:20,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:34:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:20,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:34:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:20,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:34:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:20,986 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:34:20,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:34:20,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239303828] [2023-02-15 01:34:20,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239303828] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:34:20,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777604686] [2023-02-15 01:34:20,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:20,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:34:20,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:34:20,987 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:34:20,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-15 01:34:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:21,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 140 conjunts are in the unsatisfiable core [2023-02-15 01:34:21,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:34:21,295 INFO L350 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 [2023-02-15 01:34:21,349 INFO L350 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 [2023-02-15 01:34:21,476 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:34:21,476 INFO L350 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 [2023-02-15 01:34:21,578 INFO L350 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 11 treesize of output 7 [2023-02-15 01:34:21,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:21,710 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:34:21,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2023-02-15 01:34:21,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:34:21,943 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:34:21,943 INFO L350 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 43 treesize of output 40 [2023-02-15 01:34:22,111 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:34:22,111 INFO L350 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 39 treesize of output 35 [2023-02-15 01:34:22,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:22,123 INFO L350 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 43 treesize of output 30 [2023-02-15 01:34:22,370 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:34:22,371 INFO L350 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 3 case distinctions, treesize of input 77 treesize of output 28 [2023-02-15 01:34:22,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:22,379 INFO L350 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 16 treesize of output 10 [2023-02-15 01:34:22,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:34:22,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:22,795 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:34:22,795 INFO L350 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 85 treesize of output 63 [2023-02-15 01:34:22,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:22,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:22,822 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2023-02-15 01:34:22,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 65 [2023-02-15 01:34:22,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:22,836 INFO L350 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 14 treesize of output 16 [2023-02-15 01:34:23,469 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2023-02-15 01:34:23,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 158 treesize of output 121 [2023-02-15 01:34:23,488 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:34:23,488 INFO L350 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 47 treesize of output 48 [2023-02-15 01:34:23,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:23,513 INFO L350 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 14 treesize of output 16 [2023-02-15 01:34:23,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:23,528 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:34:23,528 INFO L350 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 105 treesize of output 75 [2023-02-15 01:34:23,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:23,582 INFO L350 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 14 treesize of output 16 [2023-02-15 01:34:23,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:23,593 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:34:23,594 INFO L350 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 105 treesize of output 75 [2023-02-15 01:34:23,758 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:34:23,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:23,762 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:34:23,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 78 [2023-02-15 01:34:23,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:23,774 INFO L350 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 43 treesize of output 43 [2023-02-15 01:34:23,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:34:24,151 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:34:24,152 INFO L350 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 3 case distinctions, treesize of input 133 treesize of output 48 [2023-02-15 01:34:24,370 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:34:24,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:34:24,386 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5420 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_5420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2023-02-15 01:34:24,392 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5420 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) 1)) is different from false [2023-02-15 01:34:24,403 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5420 (Array Int Int)) (v_ArrVal_5417 (Array Int Int)) (v_ArrVal_5416 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5416))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5417)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store .cse3 .cse2 v_ArrVal_5420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) 1)) is different from false [2023-02-15 01:34:25,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777604686] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:34:25,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:34:25,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 32] total 69 [2023-02-15 01:34:25,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779273601] [2023-02-15 01:34:25,239 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:34:25,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2023-02-15 01:34:25,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:34:25,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2023-02-15 01:34:25,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=5469, Unknown=7, NotChecked=450, Total=6162 [2023-02-15 01:34:25,240 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 70 states, 65 states have (on average 1.8) internal successors, (117), 61 states have internal predecessors, (117), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:34:32,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:34:32,716 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2023-02-15 01:34:32,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-15 01:34:32,716 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 65 states have (on average 1.8) internal successors, (117), 61 states have internal predecessors, (117), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 65 [2023-02-15 01:34:32,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:34:32,717 INFO L225 Difference]: With dead ends: 141 [2023-02-15 01:34:32,717 INFO L226 Difference]: Without dead ends: 141 [2023-02-15 01:34:32,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 106 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2416 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=781, Invalid=10143, Unknown=8, NotChecked=624, Total=11556 [2023-02-15 01:34:32,718 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 642 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 2633 mSolverCounterSat, 59 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 2694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2633 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-15 01:34:32,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 1069 Invalid, 2694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2633 Invalid, 2 Unknown, 0 Unchecked, 1.5s Time] [2023-02-15 01:34:32,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-15 01:34:32,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 88. [2023-02-15 01:34:32,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.289855072463768) internal successors, (89), 83 states have internal predecessors, (89), 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) [2023-02-15 01:34:32,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2023-02-15 01:34:32,720 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 65 [2023-02-15 01:34:32,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:34:32,720 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2023-02-15 01:34:32,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 65 states have (on average 1.8) internal successors, (117), 61 states have internal predecessors, (117), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:34:32,720 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2023-02-15 01:34:32,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-15 01:34:32,720 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:34:32,720 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:34:32,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-02-15 01:34:32,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:34:32,921 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:34:32,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:34:32,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1627638347, now seen corresponding path program 1 times [2023-02-15 01:34:32,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:34:32,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294507171] [2023-02-15 01:34:32,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:32,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:34:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:38,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:34:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:38,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:34:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:38,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:34:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:39,370 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:34:39,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:34:39,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294507171] [2023-02-15 01:34:39,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294507171] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:34:39,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735672414] [2023-02-15 01:34:39,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:39,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:34:39,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:34:39,375 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:34:39,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-15 01:34:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:39,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 166 conjunts are in the unsatisfiable core [2023-02-15 01:34:39,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:34:39,764 INFO L350 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 [2023-02-15 01:34:40,040 INFO L350 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 [2023-02-15 01:34:40,045 INFO L350 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 [2023-02-15 01:34:40,274 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:34:40,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 01:34:40,294 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:34:40,294 INFO L350 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 [2023-02-15 01:34:40,487 INFO L350 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 [2023-02-15 01:34:40,500 INFO L350 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 [2023-02-15 01:34:40,614 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:34:40,615 INFO L350 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 61 treesize of output 54 [2023-02-15 01:34:40,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 01:34:40,832 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:34:40,832 INFO L350 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 47 treesize of output 41 [2023-02-15 01:34:40,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:40,849 INFO L350 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 14 treesize of output 16 [2023-02-15 01:34:40,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:40,916 INFO L350 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 21 treesize of output 20 [2023-02-15 01:34:40,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:40,926 INFO L350 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 51 treesize of output 34 [2023-02-15 01:34:41,228 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:34:41,228 INFO L350 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 3 case distinctions, treesize of input 111 treesize of output 46 [2023-02-15 01:34:41,233 INFO L350 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 11 treesize of output 7 [2023-02-15 01:34:41,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:41,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-02-15 01:34:41,239 INFO L350 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 [2023-02-15 01:34:41,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:41,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 01:34:41,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:41,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:41,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:41,687 INFO L350 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 36 treesize of output 35 [2023-02-15 01:34:41,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:41,701 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:34:41,701 INFO L350 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 121 treesize of output 89 [2023-02-15 01:34:41,722 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 01:34:41,722 INFO L350 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 [2023-02-15 01:34:42,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:42,380 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:34:42,408 INFO L321 Elim1Store]: treesize reduction 134, result has 18.8 percent of original size [2023-02-15 01:34:42,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 172 treesize of output 97 [2023-02-15 01:34:42,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:42,427 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 01:34:42,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 92 [2023-02-15 01:34:42,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:42,582 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 01:34:42,582 INFO L350 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 146 treesize of output 114 [2023-02-15 01:34:42,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:42,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:42,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 77 [2023-02-15 01:34:42,665 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-15 01:34:42,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 226 treesize of output 133 [2023-02-15 01:34:42,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:42,692 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 01:34:42,692 INFO L350 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 158 treesize of output 150 [2023-02-15 01:34:42,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:42,988 INFO L321 Elim1Store]: treesize reduction 87, result has 7.4 percent of original size [2023-02-15 01:34:42,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 228 treesize of output 107 [2023-02-15 01:34:42,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:43,000 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 01:34:43,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 49 [2023-02-15 01:34:43,440 INFO L321 Elim1Store]: treesize reduction 57, result has 5.0 percent of original size [2023-02-15 01:34:43,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 154 treesize of output 63 [2023-02-15 01:34:43,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:43,632 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 01:34:43,632 INFO L350 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 1 case distinctions, treesize of input 26 treesize of output 16 [2023-02-15 01:34:43,637 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:34:43,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:34:44,280 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5740 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5740))) (let ((.cse6 (+ (select (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (or (forall ((v_ArrVal_5744 Int) (v_ArrVal_5742 Int) (v_ArrVal_5739 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5739))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse0 (store .cse7 .cse5 (store (select .cse7 .cse5) .cse6 v_ArrVal_5744))) (.cse3 (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 v_ArrVal_5742)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ 12 (select (select .cse0 .cse1) .cse2)) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))))) (not (<= 0 .cse6)))))) (forall ((v_ArrVal_5740 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5740))) (let ((.cse11 (+ (select (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (or (forall ((v_ArrVal_5744 Int) (v_ArrVal_5742 Int) (v_ArrVal_5739 (Array Int Int))) (<= 0 (+ 8 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5739))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse8 (store .cse12 .cse10 (store (select .cse12 .cse10) .cse11 v_ArrVal_5744)))) (select (select .cse8 (select (select (store .cse9 .cse10 (store (select .cse9 .cse10) .cse11 v_ArrVal_5742)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (not (<= 0 .cse11))))))) is different from false [2023-02-15 01:34:51,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735672414] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:34:51,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:34:51,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 36] total 74 [2023-02-15 01:34:51,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275882806] [2023-02-15 01:34:51,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:34:51,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2023-02-15 01:34:51,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:34:51,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2023-02-15 01:34:51,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=7265, Unknown=73, NotChecked=172, Total=7832 [2023-02-15 01:34:51,682 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 75 states, 70 states have (on average 1.6571428571428573) internal successors, (116), 66 states have internal predecessors, (116), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:34:56,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 01:35:03,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:03,617 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2023-02-15 01:35:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-15 01:35:03,618 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 70 states have (on average 1.6571428571428573) internal successors, (116), 66 states have internal predecessors, (116), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 65 [2023-02-15 01:35:03,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:03,618 INFO L225 Difference]: With dead ends: 157 [2023-02-15 01:35:03,618 INFO L226 Difference]: Without dead ends: 157 [2023-02-15 01:35:03,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 117 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3261 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=932, Invalid=12805, Unknown=73, NotChecked=232, Total=14042 [2023-02-15 01:35:03,619 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1028 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 3063 mSolverCounterSat, 68 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 3132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3063 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:03,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 1214 Invalid, 3132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3063 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2023-02-15 01:35:03,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-15 01:35:03,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 90. [2023-02-15 01:35:03,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 85 states have internal predecessors, (91), 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) [2023-02-15 01:35:03,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2023-02-15 01:35:03,622 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 65 [2023-02-15 01:35:03,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:03,622 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2023-02-15 01:35:03,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 70 states have (on average 1.6571428571428573) internal successors, (116), 66 states have internal predecessors, (116), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:35:03,622 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2023-02-15 01:35:03,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-15 01:35:03,623 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:03,623 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:35:03,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-02-15 01:35:03,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:03,831 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:35:03,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:03,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1082819804, now seen corresponding path program 1 times [2023-02-15 01:35:03,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:03,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456509952] [2023-02-15 01:35:03,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:03,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:05,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:35:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:05,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:35:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:05,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:35:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:06,301 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:35:06,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:06,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456509952] [2023-02-15 01:35:06,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456509952] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:06,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399193321] [2023-02-15 01:35:06,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:06,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:06,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:06,309 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:35:06,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-15 01:35:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:06,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 136 conjunts are in the unsatisfiable core [2023-02-15 01:35:06,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:35:06,632 INFO L350 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 [2023-02-15 01:35:06,671 INFO L350 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 [2023-02-15 01:35:06,780 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from false [2023-02-15 01:35:06,781 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from true [2023-02-15 01:35:06,793 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from false [2023-02-15 01:35:06,794 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from true [2023-02-15 01:35:06,822 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2023-02-15 01:35:06,824 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_#valid| |c_old(#valid)|)) is different from true [2023-02-15 01:35:06,844 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |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)) is different from false [2023-02-15 01:35:06,845 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |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)) is different from true [2023-02-15 01:35:06,917 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0)) is different from false [2023-02-15 01:35:06,919 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0)) is different from true [2023-02-15 01:35:06,972 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_43| .cse1))))))) is different from false [2023-02-15 01:35:06,975 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_43| .cse1))))))) is different from true [2023-02-15 01:35:07,014 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1))))) is different from false [2023-02-15 01:35:07,017 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1))))) is different from true [2023-02-15 01:35:07,059 INFO L350 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 [2023-02-15 01:35:07,077 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2023-02-15 01:35:07,080 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from true [2023-02-15 01:35:07,133 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:35:07,133 INFO L350 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 36 treesize of output 35 [2023-02-15 01:35:07,156 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse2 (select |v_#valid_BEFORE_CALL_44| .cse2))) |v_#valid_BEFORE_CALL_44|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1))) is different from false [2023-02-15 01:35:07,159 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse2 (select |v_#valid_BEFORE_CALL_44| .cse2))) |v_#valid_BEFORE_CALL_44|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1))) is different from true [2023-02-15 01:35:07,195 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| .cse1)) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|))) is different from false [2023-02-15 01:35:07,197 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| .cse1)) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 01:35:07,246 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:35:07,246 INFO L350 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 32 treesize of output 30 [2023-02-15 01:35:07,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:07,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-02-15 01:35:07,310 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= .cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1))))))) is different from false [2023-02-15 01:35:07,313 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= .cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1))))))) is different from true [2023-02-15 01:35:07,352 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse3 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (< |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_#StackHeapBarrier|) (= (select .cse3 0) .cse0)))) is different from false [2023-02-15 01:35:07,355 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse3 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (< |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_#StackHeapBarrier|) (= (select .cse3 0) .cse0)))) is different from true [2023-02-15 01:35:07,402 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse3 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 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|) (< .cse0 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_43| .cse1)))))) (= .cse2 (select .cse3 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| .cse0 1)) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse0) 0))))))) is different from false [2023-02-15 01:35:07,405 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse3 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 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|) (< .cse0 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_43| .cse1)))))) (= .cse2 (select .cse3 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| .cse0 1)) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse0) 0))))))) is different from true [2023-02-15 01:35:07,427 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:35:07,427 INFO L350 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 3 case distinctions, treesize of input 62 treesize of output 25 [2023-02-15 01:35:07,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:35:07,458 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from false [2023-02-15 01:35:07,460 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from true [2023-02-15 01:35:07,504 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from false [2023-02-15 01:35:07,507 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from true [2023-02-15 01:35:07,578 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((v_ArrVal_6047 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6047) |c_#memory_$Pointer$.offset|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_6048 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6048) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from false [2023-02-15 01:35:07,580 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((v_ArrVal_6047 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6047) |c_#memory_$Pointer$.offset|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_6048 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6048) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from true [2023-02-15 01:35:07,619 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6050 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6050))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((v_ArrVal_6049 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6049) |c_#memory_$Pointer$.base|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from false [2023-02-15 01:35:07,622 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6050 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6050))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((v_ArrVal_6049 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6049) |c_#memory_$Pointer$.base|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from true [2023-02-15 01:35:07,659 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6052 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6052))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_6051 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6051))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from false [2023-02-15 01:35:07,662 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6052 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6052))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_6051 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6051))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from true [2023-02-15 01:35:07,700 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_ArrVal_6052 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_6052))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((v_ArrVal_6051 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_6051) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from false [2023-02-15 01:35:07,703 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_ArrVal_6052 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_6052))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((v_ArrVal_6051 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_6051) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from true [2023-02-15 01:35:07,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:07,748 INFO L350 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 14 treesize of output 16 [2023-02-15 01:35:07,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:07,771 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:35:07,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 80 [2023-02-15 01:35:07,857 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse2 (select .cse5 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (+ 2 .cse4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 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|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse4 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 0))) (= .cse2 (select .cse5 0)) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse7 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse6 (select |v_#valid_BEFORE_CALL_47| .cse6)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse8 (select |v_#valid_BEFORE_CALL_43| .cse8)))) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) is different from false [2023-02-15 01:35:07,861 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse2 (select .cse5 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (+ 2 .cse4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 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|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse4 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 0))) (= .cse2 (select .cse5 0)) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse7 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse6 (select |v_#valid_BEFORE_CALL_47| .cse6)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse8 (select |v_#valid_BEFORE_CALL_43| .cse8)))) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) is different from true [2023-02-15 01:35:08,007 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse5 (select .cse6 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 (select .cse6 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2023-02-15 01:35:08,011 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse5 (select .cse6 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 (select .cse6 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2023-02-15 01:35:08,313 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse5 (select .cse6 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 (select .cse6 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2023-02-15 01:35:08,318 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse5 (select .cse6 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 (select .cse6 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2023-02-15 01:35:08,452 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse5 (select .cse6 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 (select .cse6 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2023-02-15 01:35:08,456 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse5 (select .cse6 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 (select .cse6 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2023-02-15 01:35:08,597 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse5 (select .cse6 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 (select .cse6 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))))))) is different from false [2023-02-15 01:35:08,601 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse5 (select .cse6 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 (select .cse6 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))))))) is different from true [2023-02-15 01:35:08,661 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2023-02-15 01:35:08,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 134 treesize of output 113 [2023-02-15 01:35:08,675 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:35:08,675 INFO L350 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 28 treesize of output 35 [2023-02-15 01:35:08,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-02-15 01:35:08,806 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse8)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse1 (select .cse2 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 (select .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_60))) (and (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse4 (select |v_#valid_BEFORE_CALL_47| .cse4)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse6 (select |v_#valid_BEFORE_CALL_43| .cse6)))) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))))))) is different from false [2023-02-15 01:35:08,810 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse8)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse1 (select .cse2 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 (select .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_60))) (and (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse4 (select |v_#valid_BEFORE_CALL_47| .cse4)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse6 (select |v_#valid_BEFORE_CALL_43| .cse6)))) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))))))) is different from true [2023-02-15 01:35:08,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:08,845 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:35:08,845 INFO L350 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 119 treesize of output 93 [2023-02-15 01:35:08,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:08,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-02-15 01:35:09,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:09,036 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:35:09,036 INFO L350 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 119 treesize of output 93 [2023-02-15 01:35:09,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:09,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-02-15 01:35:09,200 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse8)) (.cse1 (select .cse2 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 (select .cse2 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|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= |v_#valid_BEFORE_CALL_47| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse3 (select |v_#valid_BEFORE_CALL_47| .cse3)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from false [2023-02-15 01:35:09,204 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse8)) (.cse1 (select .cse2 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 (select .cse2 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|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= |v_#valid_BEFORE_CALL_47| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse3 (select |v_#valid_BEFORE_CALL_47| .cse3)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from true [2023-02-15 01:35:09,590 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select .cse9 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse1) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse3) 1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse8) (= .cse3 (select .cse9 0)) (or (= .cse1 0) (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from false [2023-02-15 01:35:09,595 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select .cse9 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse1) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse3) 1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse8) (= .cse3 (select .cse9 0)) (or (= .cse1 0) (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from true [2023-02-15 01:35:09,660 INFO L321 Elim1Store]: treesize reduction 103, result has 12.7 percent of original size [2023-02-15 01:35:09,660 INFO L350 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 6 case distinctions, treesize of input 148 treesize of output 89 [2023-02-15 01:35:09,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:09,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-02-15 01:35:09,835 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse7)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse7) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse6 (select |v_#valid_BEFORE_CALL_43| .cse6)))) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse7) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse7 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))))))) is different from false [2023-02-15 01:35:09,839 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse7)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse7) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse6 (select |v_#valid_BEFORE_CALL_43| .cse6)))) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse7) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse7 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))))))) is different from true [2023-02-15 01:35:10,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-02-15 01:35:10,376 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0)) (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse3 (select |v_#valid_BEFORE_CALL_47| .cse3)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse2) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse2 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))))))) is different from false [2023-02-15 01:35:10,381 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0)) (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse3 (select |v_#valid_BEFORE_CALL_47| .cse3)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse2) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse2 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))))))) is different from true [2023-02-15 01:35:10,541 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse1)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse1) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2023-02-15 01:35:10,545 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse1)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse1) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2023-02-15 01:35:10,959 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse0 (+ 2 .cse7)) (.cse4 (select .cse8 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse2 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse3 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse1 (select |v_#valid_BEFORE_CALL_47| .cse1)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse6 (select |v_#valid_BEFORE_CALL_43| .cse6)))) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse7) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse7 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (and (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (= |c_ULTIMATE.start_main_#t~mem19#1.base| (select .cse8 |ULTIMATE.start_main_~ptr~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse4)))))) is different from false [2023-02-15 01:35:10,965 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse0 (+ 2 .cse7)) (.cse4 (select .cse8 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse2 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse3 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse1 (select |v_#valid_BEFORE_CALL_47| .cse1)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse6 (select |v_#valid_BEFORE_CALL_43| .cse6)))) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse7) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse7 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (and (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (= |c_ULTIMATE.start_main_#t~mem19#1.base| (select .cse8 |ULTIMATE.start_main_~ptr~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse4)))))) is different from true [2023-02-15 01:35:11,153 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse1 (select .cse2 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (and (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse2 |ULTIMATE.start_main_~ptr~0#1.offset|)))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse3 (select |v_#valid_BEFORE_CALL_47| .cse3)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))))))) is different from false [2023-02-15 01:35:11,157 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse1 (select .cse2 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (and (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse2 |ULTIMATE.start_main_~ptr~0#1.offset|)))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse3 (select |v_#valid_BEFORE_CALL_47| .cse3)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))))))) is different from true [2023-02-15 01:35:11,199 INFO L321 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2023-02-15 01:35:11,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 64 [2023-02-15 01:35:11,388 WARN L837 $PredicateComparison]: unable to prove that (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse1 (+ 2 v_arrayElimIndex_60)) (.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_#t~mem17#1.base| 2))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_47| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse0 (select |v_#valid_BEFORE_CALL_47| .cse0)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_#t~mem17#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_#t~mem17#1.base|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse5 (select |v_#valid_BEFORE_CALL_43| .cse5)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|)))) is different from false [2023-02-15 01:35:11,462 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse1 (+ 2 v_arrayElimIndex_60)) (.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_#t~mem17#1.base| 2))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_47| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse0 (select |v_#valid_BEFORE_CALL_47| .cse0)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_#t~mem17#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_#t~mem17#1.base|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse5 (select |v_#valid_BEFORE_CALL_43| .cse5)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|)))) is different from true [2023-02-15 01:35:11,477 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2023-02-15 01:35:11,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:35:11,572 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6061 (Array Int Int)) (v_ArrVal_6059 Int)) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6059)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6061) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-02-15 01:35:11,580 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6061 (Array Int Int)) (v_ArrVal_6059 Int)) (not (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6057))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6058))) (let ((.cse0 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6059)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store .cse2 .cse3 v_ArrVal_6061) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))))) is different from false [2023-02-15 01:35:11,594 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6061 (Array Int Int)) (v_ArrVal_6059 Int) (v_ArrVal_6054 (Array Int Int)) (v_ArrVal_6053 (Array Int Int))) (not (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6053) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6057))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6054) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6058))) (let ((.cse0 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6059)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store .cse2 .cse3 v_ArrVal_6061) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))))) is different from false [2023-02-15 01:35:11,601 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6061 (Array Int Int)) (v_ArrVal_6059 Int) (v_ArrVal_6054 (Array Int Int)) (v_ArrVal_6053 (Array Int Int))) (not (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6053) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6057))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6054) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6058))) (let ((.cse1 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6059)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store .cse2 .cse3 v_ArrVal_6061) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) is different from false [2023-02-15 01:35:11,609 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6061 (Array Int Int)) (v_ArrVal_6059 Int) (v_ArrVal_6054 (Array Int Int)) (v_ArrVal_6053 (Array Int Int))) (not (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_6053) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6057))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_6054) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6058))) (let ((.cse1 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6059)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store .cse2 .cse3 v_ArrVal_6061) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2023-02-15 01:35:11,616 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6061 (Array Int Int)) (v_ArrVal_6059 Int) (v_ArrVal_6054 (Array Int Int)) (v_ArrVal_6053 (Array Int Int))) (not (let ((.cse5 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_6053) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6057))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_6054) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6058))) (let ((.cse1 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6059)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store .cse2 .cse3 v_ArrVal_6061) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2023-02-15 01:35:11,630 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6061 (Array Int Int)) (v_ArrVal_6059 Int) (v_ArrVal_6054 (Array Int Int)) (v_ArrVal_6053 (Array Int Int))) (not (let ((.cse5 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_6053) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6057))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_6054) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6058))) (let ((.cse1 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6059)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store .cse2 .cse3 v_ArrVal_6061) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2023-02-15 01:35:11,685 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_39| Int) (v_ArrVal_6070 (Array Int Int)) (v_ArrVal_6061 (Array Int Int)) (v_ArrVal_6071 (Array Int Int)) (v_ArrVal_6059 Int) (v_ArrVal_6054 (Array Int Int)) (v_ArrVal_6053 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_39|) 0)) (not (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_39| v_ArrVal_6071)) (.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_39| v_ArrVal_6070))) (let ((.cse6 (select (select .cse7 (select (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse4 (store (store .cse7 .cse6 v_ArrVal_6053) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_39| v_ArrVal_6057))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store .cse5 .cse6 v_ArrVal_6054) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_39| v_ArrVal_6058))) (let ((.cse1 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6059)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store .cse2 .cse3 v_ArrVal_6061) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) (not (< |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_39| |c_#StackHeapBarrier|)))) is different from false [2023-02-15 01:35:11,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399193321] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:11,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:35:11,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39] total 75 [2023-02-15 01:35:11,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134603202] [2023-02-15 01:35:11,687 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:35:11,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2023-02-15 01:35:11,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:11,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2023-02-15 01:35:11,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1676, Unknown=95, NotChecked=5002, Total=6972 [2023-02-15 01:35:11,688 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 75 states, 71 states have (on average 1.591549295774648) internal successors, (113), 65 states have internal predecessors, (113), 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) [2023-02-15 01:35:11,984 WARN L837 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from false [2023-02-15 01:35:11,985 WARN L859 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from true [2023-02-15 01:35:11,988 WARN L837 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |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_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) is different from false [2023-02-15 01:35:11,989 WARN L859 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |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_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) is different from true [2023-02-15 01:35:11,992 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|)) is different from false [2023-02-15 01:35:11,993 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|)) is different from true [2023-02-15 01:35:11,996 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2023-02-15 01:35:11,998 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2023-02-15 01:35:12,001 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1)) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= (select .cse3 |c_node_create_~temp~0#1.offset|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse3)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse1 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse2) |c_#memory_$Pointer$.base|))) is different from false [2023-02-15 01:35:12,003 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1)) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= (select .cse3 |c_node_create_~temp~0#1.offset|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse3)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse1 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse2) |c_#memory_$Pointer$.base|))) is different from true [2023-02-15 01:35:12,009 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse1 |c_node_create_#res#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|) 0) 0) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse1 (select |c_#memory_$Pointer$.base| .cse1))) (= |c_#valid| (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|) 0) 0) (<= 0 |c_node_create_#res#1.offset|) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse2 |c_node_create_#res#1.base|)))) is different from false [2023-02-15 01:35:12,013 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse1 |c_node_create_#res#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|) 0) 0) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse1 (select |c_#memory_$Pointer$.base| .cse1))) (= |c_#valid| (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|) 0) 0) (<= 0 |c_node_create_#res#1.offset|) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse2 |c_node_create_#res#1.base|)))) is different from true [2023-02-15 01:35:12,022 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_43| .cse1)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2023-02-15 01:35:12,025 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_43| .cse1)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2023-02-15 01:35:12,034 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |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_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2023-02-15 01:35:12,037 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |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_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2023-02-15 01:35:12,045 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |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_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (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 [2023-02-15 01:35:12,048 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |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_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (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 [2023-02-15 01:35:12,058 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse2 (select |v_#valid_BEFORE_CALL_44| .cse2))) |v_#valid_BEFORE_CALL_44|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (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 [2023-02-15 01:35:12,061 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse2 (select |v_#valid_BEFORE_CALL_44| .cse2))) |v_#valid_BEFORE_CALL_44|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (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 [2023-02-15 01:35:12,070 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |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|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| .cse1)) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select .cse3 0)) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2023-02-15 01:35:12,072 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |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|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| .cse1)) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select .cse3 0)) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2023-02-15 01:35:12,081 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse2 (select .cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_43| .cse1)))))) (not (= .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= .cse2 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1))))))) is different from false [2023-02-15 01:35:12,084 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse2 (select .cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_43| .cse1)))))) (not (= .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= .cse2 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1))))))) is different from true [2023-02-15 01:35:12,089 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse4 4)) (.cse3 (select .cse4 0))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (< |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= .cse3 .cse0) (not (= .cse3 |c_ULTIMATE.start_dll_circular_create_#res#1.base|))))) is different from false [2023-02-15 01:35:12,092 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse4 4)) (.cse3 (select .cse4 0))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (< |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= .cse3 .cse0) (not (= .cse3 |c_ULTIMATE.start_dll_circular_create_#res#1.base|))))) is different from true [2023-02-15 01:35:12,101 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (select .cse5 0)) (.cse2 (select .cse5 4))) (and (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 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|) (< .cse1 |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse2)) (not (= .cse2 .cse1)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_43| .cse3)))))) (= (select |c_#valid| .cse1) 1) (= .cse2 .cse0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| .cse1 1)) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 0))))))) is different from false [2023-02-15 01:35:12,104 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (select .cse5 0)) (.cse2 (select .cse5 4))) (and (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 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|) (< .cse1 |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse2)) (not (= .cse2 .cse1)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_43| .cse3)))))) (= (select |c_#valid| .cse1) 1) (= .cse2 .cse0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| .cse1 1)) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 0))))))) is different from true [2023-02-15 01:35:12,113 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_old(#length)| |c_#length|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from false [2023-02-15 01:35:12,115 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_old(#length)| |c_#length|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from true [2023-02-15 01:35:12,124 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from false [2023-02-15 01:35:12,126 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from true [2023-02-15 01:35:12,134 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (= (select .cse1 |c_node_create_~temp~0#1.offset|) 0) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse2)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_43| .cse3)))))) (<= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_6047 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6047) |c_#memory_$Pointer$.offset|)) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_6048 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6048) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse1) |c_#memory_$Pointer$.base|))) is different from false [2023-02-15 01:35:12,136 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (= (select .cse1 |c_node_create_~temp~0#1.offset|) 0) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse2)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_43| .cse3)))))) (<= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_6047 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6047) |c_#memory_$Pointer$.offset|)) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_6048 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6048) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse1) |c_#memory_$Pointer$.base|))) is different from true [2023-02-15 01:35:12,146 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (exists ((v_ArrVal_6050 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6050))) (= (select .cse1 |c_node_create_~temp~0#1.offset|) 0) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse2)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_43| .cse3)))))) (exists ((v_ArrVal_6049 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6049) |c_#memory_$Pointer$.base|)) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse1) |c_#memory_$Pointer$.base|))) is different from false [2023-02-15 01:35:12,149 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (exists ((v_ArrVal_6050 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6050))) (= (select .cse1 |c_node_create_~temp~0#1.offset|) 0) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse2)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_43| .cse3)))))) (exists ((v_ArrVal_6049 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6049) |c_#memory_$Pointer$.base|)) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse1) |c_#memory_$Pointer$.base|))) is different from true [2023-02-15 01:35:12,157 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6052 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6052))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (= (select .cse1 |c_node_create_~temp~0#1.offset|) 0) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse2)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_43| .cse3)))))) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_6051 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6051))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse1) |c_#memory_$Pointer$.base|))) is different from false [2023-02-15 01:35:12,159 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6052 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6052))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (= (select .cse1 |c_node_create_~temp~0#1.offset|) 0) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse2)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_43| .cse3)))))) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_6051 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6051))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse1) |c_#memory_$Pointer$.base|))) is different from true [2023-02-15 01:35:12,204 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (and (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|) 0) 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (exists ((v_ArrVal_6052 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_6052))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (= |c_#valid| (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (exists ((v_ArrVal_6051 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_6051) |c_#memory_$Pointer$.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|) 0) 0) (<= 0 |c_node_create_#res#1.offset|) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse1 |c_node_create_#res#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0))))) is different from false [2023-02-15 01:35:12,208 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (and (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|) 0) 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (exists ((v_ArrVal_6052 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_6052))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (= |c_#valid| (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (exists ((v_ArrVal_6051 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_6051) |c_#memory_$Pointer$.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|) 0) 0) (<= 0 |c_node_create_#res#1.offset|) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse1 |c_node_create_#res#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0))))) is different from true [2023-02-15 01:35:12,244 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse4 (select .cse7 4)) (.cse1 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (+ 2 .cse6))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse1 (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse3 (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse6 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse6) 0))) (= .cse4 (select .cse7 0)) (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse9 (select .cse11 4))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse8)) .cse1 .cse3 (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (not (= .cse8 .cse9)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse9)) (not (= (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select .cse11 0)))))) (= .cse8 0)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse13 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse12 (select |v_#valid_BEFORE_CALL_47| .cse12)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse13 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse13 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse14 (select |v_#valid_BEFORE_CALL_43| .cse14)))) (<= .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) is different from false [2023-02-15 01:35:12,248 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse4 (select .cse7 4)) (.cse1 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (+ 2 .cse6))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse1 (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse3 (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse6 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse6) 0))) (= .cse4 (select .cse7 0)) (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse9 (select .cse11 4))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse8)) .cse1 .cse3 (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (not (= .cse8 .cse9)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse9)) (not (= (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select .cse11 0)))))) (= .cse8 0)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse13 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse12 (select |v_#valid_BEFORE_CALL_47| .cse12)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse13 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse13 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse14 (select |v_#valid_BEFORE_CALL_43| .cse14)))) (<= .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) is different from true [2023-02-15 01:35:12,295 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (select |c_#memory_$Pointer$.base| .cse14))) (let ((.cse0 (+ 2 .cse14)) (.cse1 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (select .cse12 4)) (.cse7 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse4 (select .cse6 4))) (and .cse1 .cse2 (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3)) (not (= .cse3 .cse4)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse4)) (not (= (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select .cse6 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) (= .cse3 0)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse9 (+ 2 v_arrayElimIndex_60))) (and (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse8 (select |v_#valid_BEFORE_CALL_47| .cse8)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse10 (select |v_#valid_BEFORE_CALL_43| .cse10)))) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|)))) .cse1 .cse2 (= .cse11 (select .cse12 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse11) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse13 (select |v_#valid_BEFORE_CALL_44| .cse13))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse11) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse14 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse14) 0))) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2023-02-15 01:35:12,299 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (select |c_#memory_$Pointer$.base| .cse14))) (let ((.cse0 (+ 2 .cse14)) (.cse1 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (select .cse12 4)) (.cse7 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse4 (select .cse6 4))) (and .cse1 .cse2 (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3)) (not (= .cse3 .cse4)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse4)) (not (= (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select .cse6 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) (= .cse3 0)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse9 (+ 2 v_arrayElimIndex_60))) (and (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse8 (select |v_#valid_BEFORE_CALL_47| .cse8)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse10 (select |v_#valid_BEFORE_CALL_43| .cse10)))) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|)))) .cse1 .cse2 (= .cse11 (select .cse12 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse11) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse13 (select |v_#valid_BEFORE_CALL_44| .cse13))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse11) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse14 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse14) 0))) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2023-02-15 01:35:12,392 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse10))) (let ((.cse0 (+ 2 .cse10)) (.cse7 (select .cse8 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse5 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) .cse5 .cse6 (= |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.offset| 0) (= .cse7 (select .cse8 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse9 (select |v_#valid_BEFORE_CALL_44| .cse9))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse7) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse10 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse10) 0))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.base| 0) (let ((.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse14 (select |c_#memory_$Pointer$.base| .cse11))) (let ((.cse12 (select .cse14 4))) (and .cse5 .cse6 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse11)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse11)) (not (= .cse11 .cse12)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse12)) (not (= (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select .cse14 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))))))))) is different from false [2023-02-15 01:35:12,396 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse10))) (let ((.cse0 (+ 2 .cse10)) (.cse7 (select .cse8 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse5 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) .cse5 .cse6 (= |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.offset| 0) (= .cse7 (select .cse8 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse9 (select |v_#valid_BEFORE_CALL_44| .cse9))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse7) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse10 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse10) 0))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.base| 0) (let ((.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse14 (select |c_#memory_$Pointer$.base| .cse11))) (let ((.cse12 (select .cse14 4))) (and .cse5 .cse6 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse11)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse11)) (not (= .cse11 .cse12)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse12)) (not (= (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select .cse14 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))))))))) is different from true [2023-02-15 01:35:12,432 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse10)) (.cse9 (select |c_#memory_$Pointer$.base| .cse12))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse0 (+ 2 .cse12)) (.cse8 (select .cse9 4)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse13 (select .cse1 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select .cse1 .cse2) (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse2 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_60))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse8 (select .cse9 0)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse10)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse11 (select |v_#valid_BEFORE_CALL_44| .cse11))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse12 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse12) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse10)) (not (= .cse10 .cse13)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse13)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))))) is different from false [2023-02-15 01:35:12,436 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse10)) (.cse9 (select |c_#memory_$Pointer$.base| .cse12))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse0 (+ 2 .cse12)) (.cse8 (select .cse9 4)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse13 (select .cse1 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select .cse1 .cse2) (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse2 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_60))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse8 (select .cse9 0)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse10)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse11 (select |v_#valid_BEFORE_CALL_44| .cse11))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse12 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse12) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse10)) (not (= .cse10 .cse13)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse13)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))))) is different from true [2023-02-15 01:35:12,477 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse13)) (.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|)) (.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse0 (+ 2 .cse13)) (.cse2 (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (select .cse9 (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4))) (.cse10 (select .cse11 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| .cse2) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| .cse3)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_60))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select .cse9 .cse1))) (= .cse10 (select .cse11 0)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse2)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse12 (select |v_#valid_BEFORE_CALL_44| .cse12))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse10) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse13 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse13) 0))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| .cse1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from false [2023-02-15 01:35:12,482 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse13)) (.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|)) (.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse0 (+ 2 .cse13)) (.cse2 (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (select .cse9 (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4))) (.cse10 (select .cse11 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| .cse2) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| .cse3)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_60))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select .cse9 .cse1))) (= .cse10 (select .cse11 0)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse2)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse12 (select |v_#valid_BEFORE_CALL_44| .cse12))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse10) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse13 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse13) 0))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| .cse1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from true [2023-02-15 01:35:12,522 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse12)) (.cse8 (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse8)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse0 (+ 2 .cse12)) (.cse9 (select .cse10 4)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (not (= (select .cse1 .cse2) (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse2 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select .cse1 (+ .cse2 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_60))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| .cse8)) (= .cse9 (select .cse10 0)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse11 (select |v_#valid_BEFORE_CALL_44| .cse11))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse9) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse12 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse12) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from false [2023-02-15 01:35:12,526 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse12)) (.cse8 (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse8)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse0 (+ 2 .cse12)) (.cse9 (select .cse10 4)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (not (= (select .cse1 .cse2) (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse2 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select .cse1 (+ .cse2 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_60))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| .cse8)) (= .cse9 (select .cse10 0)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse11 (select |v_#valid_BEFORE_CALL_44| .cse11))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse9) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse12 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse12) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from true [2023-02-15 01:35:12,575 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse10 (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse9 (select |c_#memory_$Pointer$.base| .cse12))) (let ((.cse0 (+ 2 .cse12)) (.cse8 (select .cse9 4)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse1 (select |c_#memory_$Pointer$.base| .cse10)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select .cse1 .cse2) (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse2 0) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_60))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse8 (select .cse9 0)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse10)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse11 (select |v_#valid_BEFORE_CALL_44| .cse11))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse12 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse12) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse10)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select .cse1 (+ .cse2 4))) (not (= .cse10 |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from false [2023-02-15 01:35:12,578 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse10 (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse9 (select |c_#memory_$Pointer$.base| .cse12))) (let ((.cse0 (+ 2 .cse12)) (.cse8 (select .cse9 4)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse1 (select |c_#memory_$Pointer$.base| .cse10)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select .cse1 .cse2) (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse2 0) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_60))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse8 (select .cse9 0)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse10)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse11 (select |v_#valid_BEFORE_CALL_44| .cse11))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse12 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse12) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse10)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select .cse1 (+ .cse2 4))) (not (= .cse10 |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from true [2023-02-15 01:35:12,614 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse0 (+ 2 .cse11)) (.cse3 (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (select .cse5 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (not (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse3) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= .cse4 (select .cse5 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse8 (+ 2 v_arrayElimIndex_60))) (and (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse7 (select |v_#valid_BEFORE_CALL_47| .cse7)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse9 (select |v_#valid_BEFORE_CALL_43| .cse9)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse10 (select |v_#valid_BEFORE_CALL_44| .cse10))) |v_#valid_BEFORE_CALL_44|) (= (select (store |v_#valid_BEFORE_CALL_44| .cse11 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse11) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from false [2023-02-15 01:35:12,618 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse0 (+ 2 .cse11)) (.cse3 (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (select .cse5 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (not (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse3) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= .cse4 (select .cse5 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse8 (+ 2 v_arrayElimIndex_60))) (and (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse7 (select |v_#valid_BEFORE_CALL_47| .cse7)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse9 (select |v_#valid_BEFORE_CALL_43| .cse9)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse10 (select |v_#valid_BEFORE_CALL_44| .cse10))) |v_#valid_BEFORE_CALL_44|) (= (select (store |v_#valid_BEFORE_CALL_44| .cse11 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse11) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from true [2023-02-15 01:35:12,665 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse0 (+ 2 .cse11)) (.cse3 (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (select .cse5 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse3) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= .cse4 (select .cse5 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse8 (+ 2 v_arrayElimIndex_60))) (and (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse7 (select |v_#valid_BEFORE_CALL_47| .cse7)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse9 (select |v_#valid_BEFORE_CALL_43| .cse9)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse10 (select |v_#valid_BEFORE_CALL_44| .cse10))) |v_#valid_BEFORE_CALL_44|) (= (select (store |v_#valid_BEFORE_CALL_44| .cse11 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse11) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from false [2023-02-15 01:35:12,669 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse0 (+ 2 .cse11)) (.cse3 (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (select .cse5 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse3) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= .cse4 (select .cse5 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse8 (+ 2 v_arrayElimIndex_60))) (and (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse7 (select |v_#valid_BEFORE_CALL_47| .cse7)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse9 (select |v_#valid_BEFORE_CALL_43| .cse9)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse10 (select |v_#valid_BEFORE_CALL_44| .cse10))) |v_#valid_BEFORE_CALL_44|) (= (select (store |v_#valid_BEFORE_CALL_44| .cse11 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse11) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from true [2023-02-15 01:35:12,704 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse5 (select |c_#memory_$Pointer$.base| (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse0 (+ 2 .cse11)) (.cse4 (select .cse5 4)) (.cse3 (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse3) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= .cse4 (select .cse5 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|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse7 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse8 (+ 2 v_arrayElimIndex_60))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= |v_#valid_BEFORE_CALL_47| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse6 (select |v_#valid_BEFORE_CALL_47| .cse6)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse9 (select |v_#valid_BEFORE_CALL_44| .cse9))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse10 (select |v_#valid_BEFORE_CALL_43| .cse10)))) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse11) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse11 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from false [2023-02-15 01:35:12,707 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse5 (select |c_#memory_$Pointer$.base| (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse0 (+ 2 .cse11)) (.cse4 (select .cse5 4)) (.cse3 (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse3) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= .cse4 (select .cse5 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|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse7 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse8 (+ 2 v_arrayElimIndex_60))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= |v_#valid_BEFORE_CALL_47| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse6 (select |v_#valid_BEFORE_CALL_47| .cse6)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse9 (select |v_#valid_BEFORE_CALL_44| .cse9))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse10 (select |v_#valid_BEFORE_CALL_43| .cse10)))) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse11) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse11 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from true [2023-02-15 01:35:12,752 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select .cse9 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (+ |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse1) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse3) 1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse8) (not (= .cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) .cse1))) (= .cse3 (select .cse9 0)) (or (= .cse1 0) (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from false [2023-02-15 01:35:12,756 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select .cse9 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (+ |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse1) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse3) 1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse8) (not (= .cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) .cse1))) (= .cse3 (select .cse9 0)) (or (= .cse1 0) (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from true [2023-02-15 01:35:12,795 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (+ 2 .cse4)) (.cse2 (select .cse3 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 0) (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select .cse3 .cse1) .cse4)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse7 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse8 (select |v_#valid_BEFORE_CALL_44| .cse8))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse9 (select |v_#valid_BEFORE_CALL_43| .cse9)))) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse4 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))))))) is different from false [2023-02-15 01:35:12,798 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (+ 2 .cse4)) (.cse2 (select .cse3 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 0) (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select .cse3 .cse1) .cse4)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse7 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse8 (select |v_#valid_BEFORE_CALL_44| .cse8))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse9 (select |v_#valid_BEFORE_CALL_43| .cse9)))) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse4 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))))))) is different from true [2023-02-15 01:35:12,841 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0)) (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse2) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem16#1.base|) |c_ULTIMATE.start_main_#t~mem16#1.offset|) .cse2)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse3 (select |v_#valid_BEFORE_CALL_47| .cse3)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse2) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse2 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))))))) is different from false [2023-02-15 01:35:12,844 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0)) (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse2) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem16#1.base|) |c_ULTIMATE.start_main_#t~mem16#1.offset|) .cse2)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse3 (select |v_#valid_BEFORE_CALL_47| .cse3)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse2) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse2 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))))))) is different from true [2023-02-15 01:35:12,868 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse1)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse1) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2023-02-15 01:35:12,871 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse1)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse1) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2023-02-15 01:35:12,931 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (+ 2 .cse1)) (.cse5 (select .cse8 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (and (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (= |c_ULTIMATE.start_main_#t~mem19#1.base| (select .cse8 |ULTIMATE.start_main_~ptr~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse5)))))) is different from false [2023-02-15 01:35:12,935 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (+ 2 .cse1)) (.cse5 (select .cse8 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (and (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (= |c_ULTIMATE.start_main_#t~mem19#1.base| (select .cse8 |ULTIMATE.start_main_~ptr~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse5)))))) is different from true [2023-02-15 01:35:12,965 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse0 (+ 2 .cse3)) (.cse1 (select .cse2 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (and (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse2 |ULTIMATE.start_main_~ptr~0#1.offset|)))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse5 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse6 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse4 (select |v_#valid_BEFORE_CALL_47| .cse4)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse8 (select |v_#valid_BEFORE_CALL_43| .cse8)))) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse3) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse3 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))))))) is different from false [2023-02-15 01:35:12,969 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse0 (+ 2 .cse3)) (.cse1 (select .cse2 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (and (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse2 |ULTIMATE.start_main_~ptr~0#1.offset|)))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse5 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse6 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse4 (select |v_#valid_BEFORE_CALL_47| .cse4)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse8 (select |v_#valid_BEFORE_CALL_43| .cse8)))) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse3) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse3 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))))))) is different from true [2023-02-15 01:35:13,043 WARN L837 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_#t~mem17#1.base|)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse1 (+ 2 v_arrayElimIndex_60)) (.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_#t~mem17#1.base| 2))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_47| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse0 (select |v_#valid_BEFORE_CALL_47| .cse0)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_#t~mem17#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_#t~mem17#1.base|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse5 (select |v_#valid_BEFORE_CALL_43| .cse5)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|))))) is different from false [2023-02-15 01:35:13,046 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_#t~mem17#1.base|)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse1 (+ 2 v_arrayElimIndex_60)) (.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_#t~mem17#1.base| 2))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_47| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse0 (select |v_#valid_BEFORE_CALL_47| .cse0)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_#t~mem17#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_#t~mem17#1.base|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse5 (select |v_#valid_BEFORE_CALL_43| .cse5)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|))))) is different from true [2023-02-15 01:35:13,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:13,156 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2023-02-15 01:35:13,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-15 01:35:13,156 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 71 states have (on average 1.591549295774648) internal successors, (113), 65 states have internal predecessors, (113), 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 66 [2023-02-15 01:35:13,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:13,157 INFO L225 Difference]: With dead ends: 106 [2023-02-15 01:35:13,157 INFO L226 Difference]: Without dead ends: 106 [2023-02-15 01:35:13,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 122 ConstructedPredicates, 78 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=298, Invalid=1915, Unknown=169, NotChecked=12870, Total=15252 [2023-02-15 01:35:13,158 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 2196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1702 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:13,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 878 Invalid, 2196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 491 Invalid, 0 Unknown, 1702 Unchecked, 0.2s Time] [2023-02-15 01:35:13,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-15 01:35:13,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-02-15 01:35:13,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.223529411764706) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:35:13,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2023-02-15 01:35:13,162 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 66 [2023-02-15 01:35:13,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:13,162 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2023-02-15 01:35:13,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 71 states have (on average 1.591549295774648) internal successors, (113), 65 states have internal predecessors, (113), 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) [2023-02-15 01:35:13,162 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2023-02-15 01:35:13,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-15 01:35:13,163 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:13,163 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:35:13,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-02-15 01:35:13,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-02-15 01:35:13,370 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:35:13,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:13,370 INFO L85 PathProgramCache]: Analyzing trace with hash 792357101, now seen corresponding path program 1 times [2023-02-15 01:35:13,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:13,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620998599] [2023-02-15 01:35:13,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:13,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:17,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:35:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:18,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:35:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:18,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:35:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:18,981 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:35:18,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:18,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620998599] [2023-02-15 01:35:18,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620998599] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:18,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038128817] [2023-02-15 01:35:18,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:18,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:18,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:18,983 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:35:18,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-02-15 01:35:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:19,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 200 conjunts are in the unsatisfiable core [2023-02-15 01:35:19,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:35:19,379 INFO L350 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 [2023-02-15 01:35:19,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:35:19,729 INFO L350 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 [2023-02-15 01:35:19,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:35:20,183 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:35:20,184 INFO L350 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 [2023-02-15 01:35:20,197 INFO L350 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 14 treesize of output 16 [2023-02-15 01:35:20,402 INFO L350 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 14 treesize of output 16 [2023-02-15 01:35:20,414 INFO L350 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 [2023-02-15 01:35:20,427 INFO L350 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 [2023-02-15 01:35:20,556 INFO L350 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 14 treesize of output 16 [2023-02-15 01:35:20,563 INFO L350 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 19 treesize of output 18 [2023-02-15 01:35:20,569 INFO L350 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 14 treesize of output 16 [2023-02-15 01:35:20,819 INFO L350 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 14 treesize of output 16 [2023-02-15 01:35:20,824 INFO L350 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 19 treesize of output 18 [2023-02-15 01:35:20,854 INFO L350 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 14 treesize of output 16 [2023-02-15 01:35:20,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:20,876 INFO L350 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 21 treesize of output 20 [2023-02-15 01:35:20,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:20,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2023-02-15 01:35:20,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 01:35:21,258 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:35:21,259 INFO L350 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 3 case distinctions, treesize of input 113 treesize of output 48 [2023-02-15 01:35:21,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:21,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-02-15 01:35:21,271 INFO L350 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 [2023-02-15 01:35:21,275 INFO L350 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 11 treesize of output 7 [2023-02-15 01:35:21,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:21,831 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:35:21,832 INFO L350 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 123 treesize of output 91 [2023-02-15 01:35:21,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:21,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:21,846 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 01:35:21,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 43 [2023-02-15 01:35:21,867 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-02-15 01:35:21,867 INFO L350 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 22 treesize of output 36 [2023-02-15 01:35:21,876 INFO L350 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 [2023-02-15 01:35:21,891 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 01:35:21,891 INFO L350 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 [2023-02-15 01:35:22,807 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2023-02-15 01:35:22,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 208 treesize of output 161 [2023-02-15 01:35:22,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:22,822 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:35:22,835 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 01:35:22,835 INFO L350 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 103 treesize of output 91 [2023-02-15 01:35:22,843 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:35:22,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:22,844 INFO L350 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 69 treesize of output 54 [2023-02-15 01:35:22,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:22,975 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:35:22,976 INFO L350 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 121 treesize of output 89 [2023-02-15 01:35:22,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:22,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:22,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2023-02-15 01:35:22,995 INFO L350 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 22 treesize of output 24 [2023-02-15 01:35:23,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:23,061 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:35:23,061 INFO L350 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 121 treesize of output 89 [2023-02-15 01:35:23,072 INFO L350 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 22 treesize of output 24 [2023-02-15 01:35:23,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:23,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:23,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2023-02-15 01:35:23,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:23,370 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:35:23,373 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:35:23,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 99 [2023-02-15 01:35:23,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-02-15 01:35:23,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:23,393 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 01:35:23,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 65 [2023-02-15 01:35:24,063 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2023-02-15 01:35:24,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 52 [2023-02-15 01:35:24,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:24,071 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 01:35:24,071 INFO L350 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 1 case distinctions, treesize of input 33 treesize of output 19 [2023-02-15 01:35:24,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:35:24,302 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:35:24,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:35:25,518 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse7 (+ 4 (select (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse3 (store .cse8 .cse1 (store (select .cse8 .cse1) .cse7 v_ArrVal_6397)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse5 (store .cse6 .cse1 (store (select .cse6 .cse1) .cse7 v_ArrVal_6399)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select .cse5 .cse4) .cse0))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse1 v_ArrVal_6400) .cse2) (+ 8 (select (select .cse3 .cse4) .cse0)))) (= .cse2 .cse4)))))))))))) (forall ((v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse11 (select (select .cse15 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse16 (+ 4 (select (select .cse17 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse14 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse16 v_ArrVal_6397)))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse12 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse16 v_ArrVal_6399)))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (select (select .cse14 .cse13) .cse9))) (or (= .cse9 .cse10) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse11 v_ArrVal_6400) (select (select .cse12 .cse13) .cse9)) (+ 8 .cse10)))))))) (not (<= 0 .cse9))))))))) is different from false [2023-02-15 01:35:25,593 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|))) (and (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse8 (+ (select (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse6 (store .cse9 .cse1 (store (select .cse9 .cse1) .cse8 v_ArrVal_6397)))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse2 (store .cse7 .cse1 (store (select .cse7 .cse1) .cse8 v_ArrVal_6399)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select .cse6 .cse3) .cse4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_append_~last~1#1.offset| v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse1 v_ArrVal_6400) (select (select .cse2 .cse3) .cse4)) (+ .cse5 8))) (= .cse5 .cse4)))))) (not (<= 0 .cse4)))))))) (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse16 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse12 (select (select .cse16 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse17 (+ (select (select .cse18 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse13 (store .cse18 .cse12 (store (select .cse18 .cse12) .cse17 v_ArrVal_6397)))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse15 (store .cse16 .cse12 (store (select .cse16 .cse12) .cse17 v_ArrVal_6399)))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select (select .cse15 .cse10) .cse14))) (or (= .cse10 .cse11) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_append_~last~1#1.offset| v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse12 v_ArrVal_6400) .cse11) (+ (select (select .cse13 .cse10) .cse14) 8)))))))) (not (<= 0 .cse14)))))))))) is different from false [2023-02-15 01:35:25,630 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base|))) (and (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse2 (select (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse8 (+ (select (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse4 (store .cse9 .cse2 (store (select .cse9 .cse2) .cse8 v_ArrVal_6397)))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse6 (store .cse7 .cse2 (store (select .cse7 .cse2) .cse8 v_ArrVal_6399)))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select .cse6 .cse5) .cse0))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.offset| v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse2 v_ArrVal_6400) .cse3) (+ 8 (select (select .cse4 .cse5) .cse0)))) (= .cse3 .cse5)))))))))))) (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse16 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse17 (+ (select (select .cse18 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse15 (store .cse18 .cse11 (store (select .cse18 .cse11) .cse17 v_ArrVal_6397)))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse10)) (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse12 (store .cse16 .cse11 (store (select .cse16 .cse11) .cse17 v_ArrVal_6399)))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse14 (select (select .cse15 .cse13) .cse10))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.offset| v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse11 v_ArrVal_6400) (select (select .cse12 .cse13) .cse10)) (+ 8 .cse14))) (= .cse10 .cse14)))))))))))))) is different from false [2023-02-15 01:35:25,681 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse21 (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) .cse21))) (let ((.cse1 (select |c_#memory_int| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) .cse21))) (and (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse9 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse10 (+ (select (select .cse11 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse5 (store .cse11 .cse3 (store (select .cse11 .cse3) .cse10 v_ArrVal_6397)))) (let ((.cse7 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse8 (store .cse9 .cse3 (store (select .cse9 .cse3) .cse10 v_ArrVal_6399)))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select .cse8 .cse6) .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| .cse0 (store .cse1 .cse2 v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse3 v_ArrVal_6400) .cse4) (+ (select (select .cse5 .cse6) .cse7) 8))) (= .cse6 .cse4)))))) (not (<= 0 .cse7)))))))) (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse18 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse14 (select (select .cse18 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse19 (+ (select (select .cse20 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse17 (store .cse20 .cse14 (store (select .cse20 .cse14) .cse19 v_ArrVal_6397)))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse15 (store .cse18 .cse14 (store (select .cse18 .cse14) .cse19 v_ArrVal_6399)))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse13 (select (select .cse17 .cse16) .cse12))) (or (= .cse12 .cse13) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| .cse0 (store .cse1 .cse2 v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse14 v_ArrVal_6400) (select (select .cse15 .cse16) .cse12)) (+ .cse13 8)))))))) (not (<= 0 .cse12)))))))))))) is different from false [2023-02-15 01:35:25,745 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse21 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse22 (+ (select (select |c_#memory_$Pointer$.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$.base| .cse21) .cse22))) (let ((.cse1 (select |c_#memory_int| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| .cse21) .cse22))) (and (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse9 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse10 (+ (select (select .cse11 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse5 (store .cse11 .cse3 (store (select .cse11 .cse3) .cse10 v_ArrVal_6397)))) (let ((.cse7 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse8 (store .cse9 .cse3 (store (select .cse9 .cse3) .cse10 v_ArrVal_6399)))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select .cse8 .cse6) .cse7))) (or (= (select (select (store (store (store |c_#memory_int| .cse0 (store .cse1 .cse2 v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse3 v_ArrVal_6400) .cse4) (+ 8 (select (select .cse5 .cse6) .cse7))) |c_ULTIMATE.start_main_~data~0#1|) (= .cse4 .cse6)))))) (not (<= 0 .cse7)))))))) (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse18 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse12 (select (select .cse18 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse19 (+ (select (select .cse20 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse17 (store .cse20 .cse12 (store (select .cse20 .cse12) .cse19 v_ArrVal_6397)))) (let ((.cse15 (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse13 (store .cse18 .cse12 (store (select .cse18 .cse12) .cse19 v_ArrVal_6399)))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse16 (select (select .cse17 .cse14) .cse15))) (or (= (select (select (store (store (store |c_#memory_int| .cse0 (store .cse1 .cse2 v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse12 v_ArrVal_6400) (select (select .cse13 .cse14) .cse15)) (+ 8 .cse16)) |c_ULTIMATE.start_main_~data~0#1|) (= .cse15 .cse16)))))) (not (<= 0 .cse15)))))))))))) is different from false [2023-02-15 01:35:25,848 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse21 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse22 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse21) .cse22))) (let ((.cse3 (select |c_#memory_int| .cse2)) (.cse4 (select (select |c_#memory_$Pointer$.offset| .cse21) .cse22))) (and (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6395)) (.cse9 (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6394))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse10 (+ (select (select .cse11 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse8 (store .cse11 .cse5 (store (select .cse11 .cse5) .cse10 v_ArrVal_6397)))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse6 (store .cse9 .cse5 (store (select .cse9 .cse5) .cse10 v_ArrVal_6399)))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select .cse8 .cse7) .cse0))) (or (= .cse1 .cse0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| .cse2 (store .cse3 .cse4 v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6393) .cse5 v_ArrVal_6400) (select (select .cse6 .cse7) .cse0)) (+ .cse1 8)))))))))))))) (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6395)) (.cse18 (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6394))) (let ((.cse14 (select (select .cse18 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse19 (+ (select (select .cse20 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse15 (store .cse20 .cse14 (store (select .cse20 .cse14) .cse19 v_ArrVal_6397)))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse17 (store .cse18 .cse14 (store (select .cse18 .cse14) .cse19 v_ArrVal_6399)))) (let ((.cse13 (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (select (select .cse17 .cse13) .cse16))) (or (= .cse12 .cse13) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| .cse2 (store .cse3 .cse4 v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6393) .cse14 v_ArrVal_6400) .cse12) (+ (select (select .cse15 .cse13) .cse16) 8)))))))) (not (<= 0 .cse16)))))))))))) is different from false [2023-02-15 01:35:26,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038128817] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:26,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:35:26,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 39] total 81 [2023-02-15 01:35:26,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272038863] [2023-02-15 01:35:26,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:35:26,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2023-02-15 01:35:26,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:26,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2023-02-15 01:35:26,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=7670, Unknown=17, NotChecked=1086, Total=9120 [2023-02-15 01:35:26,936 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand has 81 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 72 states have internal predecessors, (120), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:35:38,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:38,250 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2023-02-15 01:35:38,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-15 01:35:38,250 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 72 states have internal predecessors, (120), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 67 [2023-02-15 01:35:38,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:38,251 INFO L225 Difference]: With dead ends: 125 [2023-02-15 01:35:38,251 INFO L226 Difference]: Without dead ends: 125 [2023-02-15 01:35:38,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 45 SyntacticMatches, 7 SemanticMatches, 126 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2527 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=954, Invalid=13814, Unknown=18, NotChecked=1470, Total=16256 [2023-02-15 01:35:38,252 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 515 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 3539 mSolverCounterSat, 58 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 3600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 3539 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:38,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 1497 Invalid, 3600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 3539 Invalid, 3 Unknown, 0 Unchecked, 2.4s Time] [2023-02-15 01:35:38,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-15 01:35:38,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 106. [2023-02-15 01:35:38,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.2117647058823529) internal successors, (103), 99 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:35:38,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 109 transitions. [2023-02-15 01:35:38,254 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 109 transitions. Word has length 67 [2023-02-15 01:35:38,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:38,254 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 109 transitions. [2023-02-15 01:35:38,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 72 states have internal predecessors, (120), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:35:38,254 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2023-02-15 01:35:38,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-15 01:35:38,255 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:38,255 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:35:38,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-02-15 01:35:38,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-02-15 01:35:38,464 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 01:35:38,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:38,464 INFO L85 PathProgramCache]: Analyzing trace with hash -925225159, now seen corresponding path program 2 times [2023-02-15 01:35:38,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:38,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447201757] [2023-02-15 01:35:38,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:38,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:44,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:35:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:44,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:35:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:44,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:35:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:45,011 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:35:45,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:45,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447201757] [2023-02-15 01:35:45,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447201757] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:45,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126094747] [2023-02-15 01:35:45,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 01:35:45,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:45,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:45,013 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:35:45,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-02-15 01:35:45,479 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 01:35:45,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:35:45,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 215 conjunts are in the unsatisfiable core [2023-02-15 01:35:45,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:35:45,493 INFO L350 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 [2023-02-15 01:35:45,497 INFO L350 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 [2023-02-15 01:35:45,548 INFO L350 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 [2023-02-15 01:35:45,550 INFO L350 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 [2023-02-15 01:35:45,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:45,763 INFO L350 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 12 treesize of output 14 [2023-02-15 01:35:45,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:45,770 INFO L350 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 12 treesize of output 14 [2023-02-15 01:35:45,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:45,926 INFO L350 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 11 treesize of output 7 [2023-02-15 01:35:45,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:45,928 INFO L350 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 11 treesize of output 7 [2023-02-15 01:35:46,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:46,120 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 01:35:46,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-15 01:35:46,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:46,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 22 [2023-02-15 01:35:46,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:35:46,451 INFO L350 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 14 treesize of output 16 [2023-02-15 01:35:46,674 INFO L350 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 19 treesize of output 18 [2023-02-15 01:35:46,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:46,784 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:35:46,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 47 [2023-02-15 01:35:47,141 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-02-15 01:35:47,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 39 [2023-02-15 01:35:47,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:47,146 INFO L350 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 16 treesize of output 10 [2023-02-15 01:35:47,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:47,150 INFO L350 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 11 treesize of output 7 [2023-02-15 01:35:47,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:35:47,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:47,778 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 01:35:47,778 INFO L350 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 109 treesize of output 81 [2023-02-15 01:35:47,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:47,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:47,791 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-02-15 01:35:47,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 25 treesize of output 42 [2023-02-15 01:35:47,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:47,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:47,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:47,828 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2023-02-15 01:35:47,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 65 [2023-02-15 01:35:47,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:47,861 INFO L350 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 14 treesize of output 16 [2023-02-15 01:35:48,772 INFO L321 Elim1Store]: treesize reduction 88, result has 40.9 percent of original size [2023-02-15 01:35:48,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 151 treesize of output 125 [2023-02-15 01:35:48,798 INFO L321 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2023-02-15 01:35:48,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 41 [2023-02-15 01:35:49,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:49,728 INFO L321 Elim1Store]: treesize reduction 132, result has 53.4 percent of original size [2023-02-15 01:35:49,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 27 case distinctions, treesize of input 609 treesize of output 565 [2023-02-15 01:35:49,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:49,840 INFO L321 Elim1Store]: treesize reduction 102, result has 50.2 percent of original size [2023-02-15 01:35:49,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 434 treesize of output 498 [2023-02-15 01:35:50,419 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:35:52,024 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:35:55,713 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:35:55,785 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:35:55,897 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:35:55,957 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:35:59,370 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:35:59,449 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:35:59,514 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:35:59,569 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:03,941 INFO L350 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 [2023-02-15 01:36:03,988 INFO L350 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 [2023-02-15 01:36:05,606 INFO L350 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 [2023-02-15 01:36:10,184 INFO L350 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 [2023-02-15 01:36:10,765 INFO L350 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 [2023-02-15 01:36:11,416 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:11,605 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:21,755 INFO L350 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 [2023-02-15 01:36:22,331 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:22,511 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:22,611 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:22,656 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:22,797 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:23,106 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:23,153 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:23,191 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:23,227 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:23,272 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:23,323 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:25,699 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:25,806 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:26,041 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:26,268 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:26,278 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:26,364 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:26,632 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:27,371 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:27,380 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:28,668 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-15 01:36:28,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 26 [2023-02-15 01:36:28,845 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:29,039 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:29,214 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:29,279 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:29,499 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:29,513 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:29,559 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:30,021 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:35,286 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:35,326 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:35,361 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:35,390 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:35,513 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:35,525 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:35,539 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:35,563 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:35,568 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:35,609 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:35,658 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:35,685 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:35,761 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:35,827 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:35,852 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:35,869 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:35,895 INFO L350 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 16 treesize of output 12 [2023-02-15 01:36:35,929 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:35,941 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:35,975 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:35,992 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:36,009 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:36,040 INFO L350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 42 [2023-02-15 01:36:36,069 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:36,109 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:36,145 INFO L350 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 187 treesize of output 157 [2023-02-15 01:36:36,213 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:36,230 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:36,241 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:36,270 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:36,312 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:36,330 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:36,351 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:36,366 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:36,377 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:36,430 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:36,488 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:36,516 INFO L350 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 66 treesize of output 50 [2023-02-15 01:36:36,563 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:36:36,604 INFO L350 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 10 treesize of output 8 [2023-02-15 01:36:36,608 INFO L350 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 253 treesize of output 249 [2023-02-15 01:36:43,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:44,274 INFO L321 Elim1Store]: treesize reduction 590, result has 22.5 percent of original size [2023-02-15 01:36:44,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 1 disjoint index pairs (out of 66 index pairs), introduced 17 new quantified variables, introduced 75 case distinctions, treesize of input 1578 treesize of output 1187 [2023-02-15 01:36:44,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:44,480 INFO L321 Elim1Store]: treesize reduction 322, result has 28.3 percent of original size [2023-02-15 01:36:44,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 33 case distinctions, treesize of input 1111 treesize of output 1009