./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN --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 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 11:50:59,441 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:50:59,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:50:59,488 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:50:59,489 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:50:59,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:50:59,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:50:59,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:50:59,501 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:50:59,506 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:50:59,507 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:50:59,508 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:50:59,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:50:59,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:50:59,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:50:59,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:50:59,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:50:59,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:50:59,515 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:50:59,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:50:59,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:50:59,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:50:59,527 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:50:59,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:50:59,544 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:50:59,545 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:50:59,545 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:50:59,546 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:50:59,546 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:50:59,547 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:50:59,549 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:50:59,550 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:50:59,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:50:59,553 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:50:59,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:50:59,555 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:50:59,555 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:50:59,556 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:50:59,556 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:50:59,557 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:50:59,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:50:59,558 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 11:50:59,597 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:50:59,598 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:50:59,598 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:50:59,599 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:50:59,599 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:50:59,600 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:50:59,600 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:50:59,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:50:59,601 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:50:59,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:50:59,602 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:50:59,602 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 11:50:59,603 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:50:59,603 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:50:59,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:50:59,603 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 11:50:59,603 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 11:50:59,604 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 11:50:59,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:50:59,604 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 11:50:59,604 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:50:59,604 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:50:59,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:50:59,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:50:59,605 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:50:59,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:50:59,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:50:59,606 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:50:59,606 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:50:59,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:50:59,607 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN 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 -> 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 [2022-11-20 11:50:59,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:50:59,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:50:59,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:50:59,934 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:50:59,935 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:50:59,936 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2022-11-20 11:51:03,019 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:51:03,293 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:51:03,294 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2022-11-20 11:51:03,307 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/data/45bd4be61/e19e80e5b4b741c3abed3efcbfed0be0/FLAG3c7560731 [2022-11-20 11:51:03,323 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/data/45bd4be61/e19e80e5b4b741c3abed3efcbfed0be0 [2022-11-20 11:51:03,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:51:03,327 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:51:03,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:51:03,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:51:03,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:51:03,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:51:03" (1/1) ... [2022-11-20 11:51:03,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c57e382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:03, skipping insertion in model container [2022-11-20 11:51:03,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:51:03" (1/1) ... [2022-11-20 11:51:03,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:51:03,405 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:51:03,809 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/sv-benchmarks/c/list-simple/dll2c_append_unequal.i[24672,24685] [2022-11-20 11:51:03,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:51:03,829 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:51:03,906 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/sv-benchmarks/c/list-simple/dll2c_append_unequal.i[24672,24685] [2022-11-20 11:51:03,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:51:03,935 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:51:03,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:03 WrapperNode [2022-11-20 11:51:03,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:51:03,937 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:51:03,937 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:51:03,937 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:51:03,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:03" (1/1) ... [2022-11-20 11:51:03,958 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:03" (1/1) ... [2022-11-20 11:51:03,982 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 152 [2022-11-20 11:51:03,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:51:03,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:51:03,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:51:03,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:51:03,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:03" (1/1) ... [2022-11-20 11:51:03,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:03" (1/1) ... [2022-11-20 11:51:03,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:03" (1/1) ... [2022-11-20 11:51:03,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:03" (1/1) ... [2022-11-20 11:51:04,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:03" (1/1) ... [2022-11-20 11:51:04,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:03" (1/1) ... [2022-11-20 11:51:04,012 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:03" (1/1) ... [2022-11-20 11:51:04,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:03" (1/1) ... [2022-11-20 11:51:04,016 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:51:04,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:51:04,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:51:04,018 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:51:04,019 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:03" (1/1) ... [2022-11-20 11:51:04,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:51:04,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:51:04,051 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:51:04,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:51:04,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 11:51:04,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 11:51:04,106 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-20 11:51:04,106 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-20 11:51:04,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 11:51:04,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:51:04,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 11:51:04,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 11:51:04,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 11:51:04,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:51:04,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 11:51:04,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:51:04,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:51:04,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:51:04,314 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:51:04,319 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:51:04,858 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:51:04,865 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:51:04,866 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-20 11:51:04,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:51:04 BoogieIcfgContainer [2022-11-20 11:51:04,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:51:04,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:51:04,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:51:04,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:51:04,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:51:03" (1/3) ... [2022-11-20 11:51:04,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152a2608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:51:04, skipping insertion in model container [2022-11-20 11:51:04,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:03" (2/3) ... [2022-11-20 11:51:04,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152a2608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:51:04, skipping insertion in model container [2022-11-20 11:51:04,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:51:04" (3/3) ... [2022-11-20 11:51:04,888 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2022-11-20 11:51:04,923 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:51:04,928 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2022-11-20 11:51:05,014 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:51:05,023 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=FINITE_AUTOMATA, 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;@d03a8c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:51:05,023 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-11-20 11:51:05,029 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 69 states have (on average 2.1159420289855073) internal successors, (146), 133 states have internal predecessors, (146), 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) [2022-11-20 11:51:05,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 11:51:05,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:05,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 11:51:05,038 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:51:05,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:05,048 INFO L85 PathProgramCache]: Analyzing trace with hash 895672562, now seen corresponding path program 1 times [2022-11-20 11:51:05,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:05,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936708534] [2022-11-20 11:51:05,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:05,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:05,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:05,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:05,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936708534] [2022-11-20 11:51:05,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936708534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:05,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:51:05,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:51:05,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225586453] [2022-11-20 11:51:05,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:05,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:51:05,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:05,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:51:05,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:51:05,379 INFO L87 Difference]: Start difference. First operand has 138 states, 69 states have (on average 2.1159420289855073) internal successors, (146), 133 states have internal predecessors, (146), 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) [2022-11-20 11:51:05,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:05,636 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2022-11-20 11:51:05,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:51:05,640 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 [2022-11-20 11:51:05,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:05,648 INFO L225 Difference]: With dead ends: 135 [2022-11-20 11:51:05,649 INFO L226 Difference]: Without dead ends: 132 [2022-11-20 11:51:05,650 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 [2022-11-20 11:51:05,653 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 10 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:05,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 207 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:51:05,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-20 11:51:05,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-11-20 11:51:05,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 67 states have (on average 2.014925373134328) internal successors, (135), 127 states have internal predecessors, (135), 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) [2022-11-20 11:51:05,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2022-11-20 11:51:05,705 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 6 [2022-11-20 11:51:05,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:05,706 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2022-11-20 11:51:05,706 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) [2022-11-20 11:51:05,706 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2022-11-20 11:51:05,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 11:51:05,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:05,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 11:51:05,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:51:05,707 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:51:05,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:05,708 INFO L85 PathProgramCache]: Analyzing trace with hash 895672563, now seen corresponding path program 1 times [2022-11-20 11:51:05,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:05,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898757703] [2022-11-20 11:51:05,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:05,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:05,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:05,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:05,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898757703] [2022-11-20 11:51:05,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898757703] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:05,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:51:05,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:51:05,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233185957] [2022-11-20 11:51:05,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:05,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:51:05,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:05,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:51:05,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:51:05,889 INFO L87 Difference]: Start difference. First operand 132 states and 141 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) [2022-11-20 11:51:05,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:05,998 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-11-20 11:51:05,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:51:05,999 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 [2022-11-20 11:51:05,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:06,000 INFO L225 Difference]: With dead ends: 129 [2022-11-20 11:51:06,000 INFO L226 Difference]: Without dead ends: 129 [2022-11-20 11:51:06,001 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 [2022-11-20 11:51:06,002 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 5 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:06,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 209 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:51:06,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-20 11:51:06,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-11-20 11:51:06,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 67 states have (on average 1.9701492537313432) internal successors, (132), 124 states have internal predecessors, (132), 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) [2022-11-20 11:51:06,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2022-11-20 11:51:06,012 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 6 [2022-11-20 11:51:06,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:06,012 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2022-11-20 11:51:06,013 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) [2022-11-20 11:51:06,013 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2022-11-20 11:51:06,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 11:51:06,014 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:06,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:51:06,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:51:06,014 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:51:06,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:06,015 INFO L85 PathProgramCache]: Analyzing trace with hash -753542016, now seen corresponding path program 1 times [2022-11-20 11:51:06,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:06,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074570402] [2022-11-20 11:51:06,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:06,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:06,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:51:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:06,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:06,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:06,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074570402] [2022-11-20 11:51:06,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074570402] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:06,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:51:06,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:51:06,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222006998] [2022-11-20 11:51:06,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:06,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:51:06,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:06,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:51:06,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:51:06,276 INFO L87 Difference]: Start difference. First operand 129 states and 138 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) [2022-11-20 11:51:06,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:06,469 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2022-11-20 11:51:06,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:51:06,471 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 [2022-11-20 11:51:06,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:06,476 INFO L225 Difference]: With dead ends: 140 [2022-11-20 11:51:06,476 INFO L226 Difference]: Without dead ends: 140 [2022-11-20 11:51:06,481 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 [2022-11-20 11:51:06,485 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 10 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:06,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 313 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:51:06,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-20 11:51:06,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2022-11-20 11:51:06,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 68 states have (on average 1.9558823529411764) internal successors, (133), 125 states have internal predecessors, (133), 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) [2022-11-20 11:51:06,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2022-11-20 11:51:06,506 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 14 [2022-11-20 11:51:06,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:06,506 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2022-11-20 11:51:06,506 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) [2022-11-20 11:51:06,507 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2022-11-20 11:51:06,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:51:06,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:06,508 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:51:06,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 11:51:06,508 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:51:06,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:06,509 INFO L85 PathProgramCache]: Analyzing trace with hash 265974304, now seen corresponding path program 1 times [2022-11-20 11:51:06,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:06,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012205339] [2022-11-20 11:51:06,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:06,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:06,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:51:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:06,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:51:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:06,883 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:51:06,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:06,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012205339] [2022-11-20 11:51:06,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012205339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:06,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:51:06,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:51:06,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142401021] [2022-11-20 11:51:06,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:06,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:51:06,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:06,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:51:06,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:51:06,889 INFO L87 Difference]: Start difference. First operand 130 states and 139 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) [2022-11-20 11:51:07,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:07,234 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2022-11-20 11:51:07,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:51:07,235 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 [2022-11-20 11:51:07,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:07,238 INFO L225 Difference]: With dead ends: 130 [2022-11-20 11:51:07,238 INFO L226 Difference]: Without dead ends: 130 [2022-11-20 11:51:07,239 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 [2022-11-20 11:51:07,250 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 21 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:07,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 426 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:51:07,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-20 11:51:07,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-11-20 11:51:07,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 68 states have (on average 1.9411764705882353) internal successors, (132), 124 states have internal predecessors, (132), 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) [2022-11-20 11:51:07,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2022-11-20 11:51:07,260 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 24 [2022-11-20 11:51:07,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:07,260 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2022-11-20 11:51:07,260 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) [2022-11-20 11:51:07,261 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2022-11-20 11:51:07,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:51:07,261 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:07,261 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:51:07,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:51:07,262 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:51:07,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:07,262 INFO L85 PathProgramCache]: Analyzing trace with hash 265974305, now seen corresponding path program 1 times [2022-11-20 11:51:07,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:07,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134377837] [2022-11-20 11:51:07,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:07,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:07,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:51:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:07,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:51:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:07,663 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:51:07,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:07,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134377837] [2022-11-20 11:51:07,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134377837] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:07,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:51:07,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:51:07,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448028935] [2022-11-20 11:51:07,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:07,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:51:07,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:07,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:51:07,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:51:07,669 INFO L87 Difference]: Start difference. First operand 129 states and 138 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) [2022-11-20 11:51:08,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:08,002 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2022-11-20 11:51:08,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:51:08,005 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 [2022-11-20 11:51:08,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:08,006 INFO L225 Difference]: With dead ends: 129 [2022-11-20 11:51:08,006 INFO L226 Difference]: Without dead ends: 129 [2022-11-20 11:51:08,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:51:08,007 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 19 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:08,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 450 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:51:08,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-20 11:51:08,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2022-11-20 11:51:08,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 68 states have (on average 1.9264705882352942) internal successors, (131), 123 states have internal predecessors, (131), 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) [2022-11-20 11:51:08,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2022-11-20 11:51:08,021 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 24 [2022-11-20 11:51:08,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:08,022 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2022-11-20 11:51:08,022 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) [2022-11-20 11:51:08,027 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2022-11-20 11:51:08,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:51:08,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:08,028 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:51:08,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 11:51:08,029 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:51:08,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:08,030 INFO L85 PathProgramCache]: Analyzing trace with hash -2096731903, now seen corresponding path program 1 times [2022-11-20 11:51:08,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:08,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982479056] [2022-11-20 11:51:08,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:08,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:08,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:51:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:08,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:51:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:08,455 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:51:08,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:08,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982479056] [2022-11-20 11:51:08,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982479056] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:08,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121942930] [2022-11-20 11:51:08,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:08,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:51:08,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:51:08,463 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:51:08,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:51:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:08,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 11:51:08,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:51:08,700 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 [2022-11-20 11:51:08,800 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 [2022-11-20 11:51:08,958 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:51:08,959 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 [2022-11-20 11:51:08,981 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-20 11:51:08,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:51:09,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121942930] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:09,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:51:09,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-11-20 11:51:09,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491170034] [2022-11-20 11:51:09,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:51:09,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 11:51:09,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:09,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 11:51:09,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2022-11-20 11:51:09,063 INFO L87 Difference]: Start difference. First operand 128 states and 137 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) [2022-11-20 11:51:09,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:09,520 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-11-20 11:51:09,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:51:09,521 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 [2022-11-20 11:51:09,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:09,522 INFO L225 Difference]: With dead ends: 135 [2022-11-20 11:51:09,522 INFO L226 Difference]: Without dead ends: 135 [2022-11-20 11:51:09,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2022-11-20 11:51:09,523 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 5 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:09,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 495 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 394 Invalid, 0 Unknown, 153 Unchecked, 0.4s Time] [2022-11-20 11:51:09,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-20 11:51:09,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-11-20 11:51:09,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.9027777777777777) internal successors, (137), 127 states have internal predecessors, (137), 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) [2022-11-20 11:51:09,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-11-20 11:51:09,530 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 26 [2022-11-20 11:51:09,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:09,530 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-11-20 11:51:09,530 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) [2022-11-20 11:51:09,530 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-11-20 11:51:09,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:51:09,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:09,531 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:51:09,543 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 11:51:09,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-20 11:51:09,743 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:51:09,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:09,744 INFO L85 PathProgramCache]: Analyzing trace with hash -2096731902, now seen corresponding path program 1 times [2022-11-20 11:51:09,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:09,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041857291] [2022-11-20 11:51:09,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:09,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:10,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:51:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:10,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:51:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:10,236 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:51:10,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:10,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041857291] [2022-11-20 11:51:10,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041857291] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:10,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489217728] [2022-11-20 11:51:10,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:10,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:51:10,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:51:10,239 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:51:10,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 11:51:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:10,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-20 11:51:10,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:51:10,394 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 [2022-11-20 11:51:10,746 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:51:10,746 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 14 treesize of output 20 [2022-11-20 11:51:10,764 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:51:10,765 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 [2022-11-20 11:51:10,844 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:10,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:51:15,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489217728] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:15,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:51:15,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2022-11-20 11:51:15,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993630663] [2022-11-20 11:51:15,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:51:15,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-20 11:51:15,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:15,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-20 11:51:15,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2022-11-20 11:51:15,072 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 14 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) [2022-11-20 11:51:15,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:15,859 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-11-20 11:51:15,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:51:15,860 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 14 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 [2022-11-20 11:51:15,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:15,861 INFO L225 Difference]: With dead ends: 135 [2022-11-20 11:51:15,861 INFO L226 Difference]: Without dead ends: 135 [2022-11-20 11:51:15,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2022-11-20 11:51:15,862 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 5 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 161 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:15,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 853 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 713 Invalid, 0 Unknown, 161 Unchecked, 0.6s Time] [2022-11-20 11:51:15,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-20 11:51:15,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-11-20 11:51:15,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.8888888888888888) internal successors, (136), 127 states have internal predecessors, (136), 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) [2022-11-20 11:51:15,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2022-11-20 11:51:15,883 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 26 [2022-11-20 11:51:15,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:15,883 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2022-11-20 11:51:15,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 14 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) [2022-11-20 11:51:15,884 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2022-11-20 11:51:15,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 11:51:15,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:15,885 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] [2022-11-20 11:51:15,896 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 11:51:16,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:51:16,092 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:51:16,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:16,092 INFO L85 PathProgramCache]: Analyzing trace with hash -619542825, now seen corresponding path program 1 times [2022-11-20 11:51:16,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:16,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434498333] [2022-11-20 11:51:16,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:16,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:16,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:51:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:16,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:51:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:16,312 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:51:16,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:16,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434498333] [2022-11-20 11:51:16,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434498333] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:16,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765068336] [2022-11-20 11:51:16,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:16,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:51:16,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:51:16,315 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:51:16,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 11:51:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:16,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 11:51:16,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:51:16,525 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:51:16,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:51:16,614 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:51:16,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765068336] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:51:16,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:51:16,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-20 11:51:16,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434034623] [2022-11-20 11:51:16,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:51:16,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:51:16,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:16,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:51:16,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:51:16,617 INFO L87 Difference]: Start difference. First operand 133 states and 144 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) [2022-11-20 11:51:16,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:16,839 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2022-11-20 11:51:16,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:51:16,840 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 [2022-11-20 11:51:16,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:16,841 INFO L225 Difference]: With dead ends: 134 [2022-11-20 11:51:16,841 INFO L226 Difference]: Without dead ends: 134 [2022-11-20 11:51:16,841 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 [2022-11-20 11:51:16,842 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 4 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:16,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 660 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:51:16,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-20 11:51:16,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-11-20 11:51:16,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.875) internal successors, (135), 127 states have internal predecessors, (135), 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) [2022-11-20 11:51:16,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2022-11-20 11:51:16,846 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 28 [2022-11-20 11:51:16,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:16,847 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2022-11-20 11:51:16,847 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) [2022-11-20 11:51:16,847 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2022-11-20 11:51:16,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 11:51:16,848 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:16,848 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] [2022-11-20 11:51:16,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 11:51:17,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:51:17,049 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:51:17,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:17,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2030739054, now seen corresponding path program 1 times [2022-11-20 11:51:17,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:17,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541313615] [2022-11-20 11:51:17,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:17,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:17,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:51:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:17,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:51:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:17,160 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 11:51:17,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:17,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541313615] [2022-11-20 11:51:17,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541313615] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:17,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851286649] [2022-11-20 11:51:17,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:17,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:51:17,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:51:17,163 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:51:17,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 11:51:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:17,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 11:51:17,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:51:17,338 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 11:51:17,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:51:17,352 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 11:51:17,353 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 [2022-11-20 11:51:17,376 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 11:51:17,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851286649] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:51:17,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:51:17,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2022-11-20 11:51:17,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661476838] [2022-11-20 11:51:17,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:51:17,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:51:17,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:17,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:51:17,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:51:17,379 INFO L87 Difference]: Start difference. First operand 133 states and 143 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) [2022-11-20 11:51:17,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:17,654 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2022-11-20 11:51:17,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:51:17,656 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 [2022-11-20 11:51:17,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:17,656 INFO L225 Difference]: With dead ends: 138 [2022-11-20 11:51:17,657 INFO L226 Difference]: Without dead ends: 138 [2022-11-20 11:51:17,657 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 [2022-11-20 11:51:17,657 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 12 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:17,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 429 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:51:17,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-20 11:51:17,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2022-11-20 11:51:17,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.8666666666666667) internal successors, (140), 130 states have internal predecessors, (140), 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) [2022-11-20 11:51:17,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2022-11-20 11:51:17,664 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 29 [2022-11-20 11:51:17,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:17,664 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2022-11-20 11:51:17,664 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) [2022-11-20 11:51:17,665 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2022-11-20 11:51:17,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 11:51:17,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:17,666 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] [2022-11-20 11:51:17,677 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 11:51:17,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-20 11:51:17,872 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:51:17,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:17,872 INFO L85 PathProgramCache]: Analyzing trace with hash -2030739053, now seen corresponding path program 1 times [2022-11-20 11:51:17,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:17,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033067780] [2022-11-20 11:51:17,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:17,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:18,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:51:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:18,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:51:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:18,174 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:51:18,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:18,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033067780] [2022-11-20 11:51:18,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033067780] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:18,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677178973] [2022-11-20 11:51:18,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:18,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:51:18,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:51:18,177 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:51:18,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 11:51:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:18,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 11:51:18,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:51:18,480 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:51:18,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:51:18,518 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:51:18,518 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 [2022-11-20 11:51:18,679 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:51:18,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677178973] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:51:18,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:51:18,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2022-11-20 11:51:18,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494095048] [2022-11-20 11:51:18,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:51:18,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 11:51:18,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:18,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 11:51:18,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-11-20 11:51:18,682 INFO L87 Difference]: Start difference. First operand 136 states and 148 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) [2022-11-20 11:51:19,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:19,083 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2022-11-20 11:51:19,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 11:51:19,083 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 [2022-11-20 11:51:19,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:19,085 INFO L225 Difference]: With dead ends: 143 [2022-11-20 11:51:19,085 INFO L226 Difference]: Without dead ends: 143 [2022-11-20 11:51:19,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-11-20 11:51:19,086 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 28 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:19,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1226 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:51:19,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-20 11:51:19,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 136. [2022-11-20 11:51:19,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 130 states have internal predecessors, (139), 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) [2022-11-20 11:51:19,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2022-11-20 11:51:19,091 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 29 [2022-11-20 11:51:19,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:19,091 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2022-11-20 11:51:19,091 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) [2022-11-20 11:51:19,092 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2022-11-20 11:51:19,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 11:51:19,092 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:19,092 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] [2022-11-20 11:51:19,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 11:51:19,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 11:51:19,298 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:51:19,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:19,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1471598771, now seen corresponding path program 1 times [2022-11-20 11:51:19,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:19,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873480994] [2022-11-20 11:51:19,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:19,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:19,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:51:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:19,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:51:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:51:19,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:19,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873480994] [2022-11-20 11:51:19,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873480994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:19,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:51:19,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:51:19,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957260612] [2022-11-20 11:51:19,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:19,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:51:19,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:19,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:51:19,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:51:19,465 INFO L87 Difference]: Start difference. First operand 136 states and 147 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) [2022-11-20 11:51:19,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:19,815 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-11-20 11:51:19,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:51:19,815 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 [2022-11-20 11:51:19,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:19,816 INFO L225 Difference]: With dead ends: 136 [2022-11-20 11:51:19,816 INFO L226 Difference]: Without dead ends: 136 [2022-11-20 11:51:19,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:51:19,817 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 24 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:19,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 475 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:51:19,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-20 11:51:19,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2022-11-20 11:51:19,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 75 states have (on average 1.84) internal successors, (138), 129 states have internal predecessors, (138), 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) [2022-11-20 11:51:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-11-20 11:51:19,821 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 30 [2022-11-20 11:51:19,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:19,821 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-11-20 11:51:19,822 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) [2022-11-20 11:51:19,822 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-11-20 11:51:19,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 11:51:19,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:19,822 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] [2022-11-20 11:51:19,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 11:51:19,823 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:51:19,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:19,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1471598772, now seen corresponding path program 1 times [2022-11-20 11:51:19,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:19,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383379369] [2022-11-20 11:51:19,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:19,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:20,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:51:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:20,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:51:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:20,132 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:51:20,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:20,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383379369] [2022-11-20 11:51:20,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383379369] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:20,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:51:20,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:51:20,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210775218] [2022-11-20 11:51:20,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:20,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:51:20,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:20,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:51:20,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:51:20,136 INFO L87 Difference]: Start difference. First operand 135 states and 146 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) [2022-11-20 11:51:20,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:20,503 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2022-11-20 11:51:20,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:51:20,504 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 [2022-11-20 11:51:20,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:20,504 INFO L225 Difference]: With dead ends: 134 [2022-11-20 11:51:20,505 INFO L226 Difference]: Without dead ends: 134 [2022-11-20 11:51:20,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:51:20,505 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 20 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:20,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 505 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:51:20,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-20 11:51:20,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-11-20 11:51:20,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 75 states have (on average 1.8266666666666667) internal successors, (137), 128 states have internal predecessors, (137), 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) [2022-11-20 11:51:20,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2022-11-20 11:51:20,509 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 30 [2022-11-20 11:51:20,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:20,509 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2022-11-20 11:51:20,510 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) [2022-11-20 11:51:20,510 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2022-11-20 11:51:20,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 11:51:20,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:20,510 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] [2022-11-20 11:51:20,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 11:51:20,513 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:51:20,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:20,514 INFO L85 PathProgramCache]: Analyzing trace with hash 939320083, now seen corresponding path program 1 times [2022-11-20 11:51:20,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:20,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388394068] [2022-11-20 11:51:20,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:20,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:20,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:51:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:20,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:51:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:20,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-20 11:51:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:20,726 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 11:51:20,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:20,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388394068] [2022-11-20 11:51:20,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388394068] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:20,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541045186] [2022-11-20 11:51:20,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:20,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:51:20,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:51:20,728 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:51:20,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 11:51:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:20,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 11:51:20,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:51:20,989 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 11:51:20,990 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:51:20,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541045186] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:20,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:51:20,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-20 11:51:20,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672913129] [2022-11-20 11:51:20,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:20,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:51:20,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:20,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:51:20,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:51:20,992 INFO L87 Difference]: Start difference. First operand 134 states and 145 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) [2022-11-20 11:51:21,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:21,008 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2022-11-20 11:51:21,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:51:21,009 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 [2022-11-20 11:51:21,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:21,009 INFO L225 Difference]: With dead ends: 122 [2022-11-20 11:51:21,010 INFO L226 Difference]: Without dead ends: 122 [2022-11-20 11:51:21,010 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 [2022-11-20 11:51:21,011 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 214 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:21,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 142 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:51:21,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-20 11:51:21,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-11-20 11:51:21,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 68 states have (on average 1.8088235294117647) internal successors, (123), 117 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) [2022-11-20 11:51:21,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2022-11-20 11:51:21,017 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 41 [2022-11-20 11:51:21,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:21,018 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2022-11-20 11:51:21,018 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) [2022-11-20 11:51:21,018 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2022-11-20 11:51:21,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-20 11:51:21,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:21,023 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] [2022-11-20 11:51:21,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 11:51:21,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-20 11:51:21,230 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:51:21,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:21,230 INFO L85 PathProgramCache]: Analyzing trace with hash -566913869, now seen corresponding path program 1 times [2022-11-20 11:51:21,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:21,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944952892] [2022-11-20 11:51:21,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:21,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:21,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:51:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:21,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:51:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:21,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:51:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:21,819 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 11:51:21,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:21,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944952892] [2022-11-20 11:51:21,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944952892] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:21,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639069111] [2022-11-20 11:51:21,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:21,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:51:21,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:51:21,822 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:51:21,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 11:51:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:22,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-20 11:51:22,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:51:22,084 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 [2022-11-20 11:51:22,098 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 [2022-11-20 11:51:22,121 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 [2022-11-20 11:51:22,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:22,194 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 [2022-11-20 11:51:22,219 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 [2022-11-20 11:51:22,226 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 [2022-11-20 11:51:22,253 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:51:22,253 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 [2022-11-20 11:51:22,324 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 [2022-11-20 11:51:22,341 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_1584 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1584))))) is different from true [2022-11-20 11:51:22,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:22,388 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 [2022-11-20 11:51:22,393 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2022-11-20 11:51:22,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:51:22,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639069111] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:22,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:51:22,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-11-20 11:51:22,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310377416] [2022-11-20 11:51:22,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:51:22,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 11:51:22,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:22,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 11:51:22,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=125, Unknown=3, NotChecked=72, Total=240 [2022-11-20 11:51:22,459 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 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) [2022-11-20 11:51:23,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:23,102 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions. [2022-11-20 11:51:23,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:51:23,102 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 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 [2022-11-20 11:51:23,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:23,103 INFO L225 Difference]: With dead ends: 133 [2022-11-20 11:51:23,103 INFO L226 Difference]: Without dead ends: 133 [2022-11-20 11:51:23,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=218, Unknown=3, NotChecked=96, Total=380 [2022-11-20 11:51:23,104 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 143 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 401 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:23,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 508 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 590 Invalid, 0 Unknown, 401 Unchecked, 0.5s Time] [2022-11-20 11:51:23,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-20 11:51:23,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 115. [2022-11-20 11:51:23,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 68 states have (on average 1.7058823529411764) internal successors, (116), 110 states have internal predecessors, (116), 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) [2022-11-20 11:51:23,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2022-11-20 11:51:23,108 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 43 [2022-11-20 11:51:23,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:23,108 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2022-11-20 11:51:23,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 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) [2022-11-20 11:51:23,108 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2022-11-20 11:51:23,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-20 11:51:23,109 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:23,109 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] [2022-11-20 11:51:23,117 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 11:51:23,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 11:51:23,310 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:51:23,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:23,310 INFO L85 PathProgramCache]: Analyzing trace with hash -566913868, now seen corresponding path program 1 times [2022-11-20 11:51:23,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:23,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862921704] [2022-11-20 11:51:23,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:23,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:23,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:51:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:23,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:51:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:23,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:51:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:24,072 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 11:51:24,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:24,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862921704] [2022-11-20 11:51:24,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862921704] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:24,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788860722] [2022-11-20 11:51:24,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:24,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:51:24,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:51:24,074 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:51:24,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 11:51:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:24,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-20 11:51:24,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:51:24,353 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 [2022-11-20 11:51:24,369 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 [2022-11-20 11:51:24,388 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1821 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1821) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-20 11:51:24,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:24,437 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 [2022-11-20 11:51:24,464 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 [2022-11-20 11:51:24,472 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_1822 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1822))))) is different from true [2022-11-20 11:51:24,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:24,516 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 [2022-11-20 11:51: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 [2022-11-20 11:51:24,601 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 [2022-11-20 11:51:24,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:24,648 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 [2022-11-20 11:51:24,657 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2022-11-20 11:51:24,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:51:26,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788860722] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:26,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:51:26,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2022-11-20 11:51:26,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740711284] [2022-11-20 11:51:26,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:51:26,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 11:51:26,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:26,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 11:51:26,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=147, Unknown=3, NotChecked=78, Total=272 [2022-11-20 11:51:26,799 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand has 15 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 11:51:27,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:27,361 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2022-11-20 11:51:27,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:51:27,362 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-11-20 11:51:27,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:27,363 INFO L225 Difference]: With dead ends: 125 [2022-11-20 11:51:27,363 INFO L226 Difference]: Without dead ends: 125 [2022-11-20 11:51:27,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=66, Invalid=215, Unknown=3, NotChecked=96, Total=380 [2022-11-20 11:51:27,364 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 270 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 378 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:27,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 259 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 421 Invalid, 0 Unknown, 378 Unchecked, 0.5s Time] [2022-11-20 11:51:27,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-20 11:51:27,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2022-11-20 11:51:27,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 68 states have (on average 1.588235294117647) internal successors, (108), 102 states have internal predecessors, (108), 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) [2022-11-20 11:51:27,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2022-11-20 11:51:27,368 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 43 [2022-11-20 11:51:27,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:27,369 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2022-11-20 11:51:27,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 11:51:27,370 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2022-11-20 11:51:27,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-20 11:51:27,370 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:27,371 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] [2022-11-20 11:51:27,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 11:51:27,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 11:51:27,577 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:51:27,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:27,577 INFO L85 PathProgramCache]: Analyzing trace with hash 656619060, now seen corresponding path program 1 times [2022-11-20 11:51:27,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:27,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256092244] [2022-11-20 11:51:27,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:27,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:27,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:51:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:27,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:51:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:27,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:51:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:27,771 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 11:51:27,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:27,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256092244] [2022-11-20 11:51:27,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256092244] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:27,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:51:27,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:51:27,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741894207] [2022-11-20 11:51:27,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:27,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:51:27,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:27,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:51:27,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:51:27,774 INFO L87 Difference]: Start difference. First operand 107 states and 114 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) [2022-11-20 11:51:28,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:28,015 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2022-11-20 11:51:28,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:51:28,015 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 [2022-11-20 11:51:28,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:28,016 INFO L225 Difference]: With dead ends: 121 [2022-11-20 11:51:28,016 INFO L226 Difference]: Without dead ends: 121 [2022-11-20 11:51:28,017 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 [2022-11-20 11:51:28,017 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 79 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:28,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 282 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:51:28,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-20 11:51:28,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 103. [2022-11-20 11:51:28,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 98 states have internal predecessors, (104), 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) [2022-11-20 11:51:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2022-11-20 11:51:28,022 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 45 [2022-11-20 11:51:28,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:28,022 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2022-11-20 11:51:28,022 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) [2022-11-20 11:51:28,022 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2022-11-20 11:51:28,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-20 11:51:28,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:28,023 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] [2022-11-20 11:51:28,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 11:51:28,024 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:51:28,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:28,024 INFO L85 PathProgramCache]: Analyzing trace with hash 656619061, now seen corresponding path program 1 times [2022-11-20 11:51:28,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:28,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885282757] [2022-11-20 11:51:28,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:28,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:28,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:51:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:28,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:51:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:28,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:51:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:28,305 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 11:51:28,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:28,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885282757] [2022-11-20 11:51:28,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885282757] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:28,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:51:28,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:51:28,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159103946] [2022-11-20 11:51:28,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:28,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:51:28,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:28,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:51:28,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:51:28,309 INFO L87 Difference]: Start difference. First operand 103 states and 110 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) [2022-11-20 11:51:28,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:28,550 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2022-11-20 11:51:28,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:51:28,551 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 [2022-11-20 11:51:28,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:28,552 INFO L225 Difference]: With dead ends: 99 [2022-11-20 11:51:28,552 INFO L226 Difference]: Without dead ends: 99 [2022-11-20 11:51:28,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:51:28,553 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 78 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:28,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 297 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:51:28,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-20 11:51:28,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-11-20 11:51:28,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 94 states have internal predecessors, (100), 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) [2022-11-20 11:51:28,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2022-11-20 11:51:28,557 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 45 [2022-11-20 11:51:28,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:28,557 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2022-11-20 11:51:28,557 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) [2022-11-20 11:51:28,558 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2022-11-20 11:51:28,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-20 11:51:28,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:28,558 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] [2022-11-20 11:51:28,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 11:51:28,559 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:51:28,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:28,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1119634675, now seen corresponding path program 1 times [2022-11-20 11:51:28,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:28,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883320012] [2022-11-20 11:51:28,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:28,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:29,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:51:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:29,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:51:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:29,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:51:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:29,412 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 11:51:29,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:29,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883320012] [2022-11-20 11:51:29,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883320012] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:29,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408013791] [2022-11-20 11:51:29,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:29,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:51:29,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:51:29,415 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:51:29,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 11:51:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:29,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-20 11:51:29,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:51:29,763 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 [2022-11-20 11:51:30,010 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 [2022-11-20 11:51:30,180 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2355 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2355))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-11-20 11:51:30,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:30,214 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 [2022-11-20 11:51:30,231 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-20 11:51:30,232 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 18 [2022-11-20 11:51:30,341 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 [2022-11-20 11:51:30,356 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-20 11:51:30,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:51:30,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408013791] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:30,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:51:30,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2022-11-20 11:51:30,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950374051] [2022-11-20 11:51:30,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:51:30,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-20 11:51:30,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:30,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-20 11:51:30,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=615, Unknown=7, NotChecked=50, Total=756 [2022-11-20 11:51:30,487 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 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) [2022-11-20 11:51:31,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:31,154 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2022-11-20 11:51:31,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 11:51:31,155 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 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 [2022-11-20 11:51:31,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:31,156 INFO L225 Difference]: With dead ends: 98 [2022-11-20 11:51:31,156 INFO L226 Difference]: Without dead ends: 98 [2022-11-20 11:51:31,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=136, Invalid=915, Unknown=9, NotChecked=62, Total=1122 [2022-11-20 11:51:31,158 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 30 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:31,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 562 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 454 Invalid, 0 Unknown, 154 Unchecked, 0.4s Time] [2022-11-20 11:51:31,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-20 11:51:31,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-11-20 11:51:31,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 93 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) [2022-11-20 11:51:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2022-11-20 11:51:31,162 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 46 [2022-11-20 11:51:31,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:31,162 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2022-11-20 11:51:31,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 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) [2022-11-20 11:51:31,162 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2022-11-20 11:51:31,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-20 11:51:31,163 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:31,163 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] [2022-11-20 11:51:31,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 11:51:31,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 11:51:31,370 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:51:31,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:31,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1119634674, now seen corresponding path program 1 times [2022-11-20 11:51:31,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:31,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618211453] [2022-11-20 11:51:31,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:31,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:32,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:51:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:32,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:51:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:32,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:51:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:32,975 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:51:32,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:32,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618211453] [2022-11-20 11:51:32,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618211453] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:32,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773977167] [2022-11-20 11:51:32,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:32,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:51:32,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:51:32,977 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:51:32,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 11:51:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:33,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-20 11:51:33,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:51:33,316 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 [2022-11-20 11:51:33,828 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 19 treesize of output 11 [2022-11-20 11:51:33,835 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 [2022-11-20 11:51:34,085 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2601 (Array Int Int)) (v_ArrVal_2600 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2600)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2601) |c_#memory_$Pointer$.offset|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-20 11:51:34,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:34,138 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 25 treesize of output 25 [2022-11-20 11:51:34,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:34,146 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 [2022-11-20 11:51:34,160 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 11:51:34,161 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 [2022-11-20 11:51:34,166 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 18 treesize of output 13 [2022-11-20 11:51:34,236 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 [2022-11-20 11:51:34,241 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 [2022-11-20 11:51:34,278 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-20 11:51:34,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:51:34,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773977167] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:34,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:51:34,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2022-11-20 11:51:34,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123135388] [2022-11-20 11:51:34,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:51:34,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-20 11:51:34,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:34,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-20 11:51:34,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=897, Unknown=1, NotChecked=60, Total=1056 [2022-11-20 11:51:34,626 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 30 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 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) [2022-11-20 11:51:36,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:36,385 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2022-11-20 11:51:36,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 11:51:36,386 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 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 [2022-11-20 11:51:36,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:36,387 INFO L225 Difference]: With dead ends: 97 [2022-11-20 11:51:36,387 INFO L226 Difference]: Without dead ends: 97 [2022-11-20 11:51:36,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=198, Invalid=1527, Unknown=1, NotChecked=80, Total=1806 [2022-11-20 11:51:36,388 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 210 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:36,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 788 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1114 Invalid, 0 Unknown, 101 Unchecked, 1.1s Time] [2022-11-20 11:51:36,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-20 11:51:36,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-11-20 11:51:36,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.4411764705882353) internal successors, (98), 92 states have internal predecessors, (98), 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) [2022-11-20 11:51:36,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2022-11-20 11:51:36,392 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 46 [2022-11-20 11:51:36,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:36,393 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2022-11-20 11:51:36,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 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) [2022-11-20 11:51:36,393 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2022-11-20 11:51:36,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-20 11:51:36,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:36,394 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] [2022-11-20 11:51:36,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 11:51:36,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:51:36,600 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:51:36,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:36,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2067869774, now seen corresponding path program 1 times [2022-11-20 11:51:36,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:36,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924152972] [2022-11-20 11:51:36,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:36,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:37,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:51:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:37,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:51:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:37,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:51:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:38,999 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:51:38,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:38,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924152972] [2022-11-20 11:51:38,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924152972] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:38,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300975237] [2022-11-20 11:51:39,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:39,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:51:39,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:51:39,001 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:51:39,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 11:51:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:39,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-20 11:51:39,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:51:39,362 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 [2022-11-20 11:51:39,664 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 [2022-11-20 11:51:39,874 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:51:39,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2022-11-20 11:51:39,881 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 18 treesize of output 14 [2022-11-20 11:51:39,890 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:51:39,891 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 7 [2022-11-20 11:51:40,151 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2856 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_2855 (Array Int Int))) (and (<= (+ |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|))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2855) |c_#memory_$Pointer$.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2856) |c_#memory_$Pointer$.base|))) is different from true [2022-11-20 11:51:40,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:40,220 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:51:40,220 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 [2022-11-20 11:51:40,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:40,231 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 [2022-11-20 11:51:40,275 INFO L321 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2022-11-20 11:51:40,275 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 [2022-11-20 11:51:40,364 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 [2022-11-20 11:51:40,446 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:51:40,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2022-11-20 11:51:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-20 11:51:40,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:51:40,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300975237] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:40,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:51:40,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 34 [2022-11-20 11:51:40,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328772431] [2022-11-20 11:51:40,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:51:40,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-20 11:51:40,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:40,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-20 11:51:40,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1220, Unknown=1, NotChecked=70, Total=1406 [2022-11-20 11:51:40,808 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 35 states, 32 states have (on average 2.1875) internal successors, (70), 31 states have internal predecessors, (70), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-20 11:51:43,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:43,231 INFO L93 Difference]: Finished difference Result 181 states and 195 transitions. [2022-11-20 11:51:43,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 11:51:43,232 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 2.1875) internal successors, (70), 31 states have internal predecessors, (70), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 48 [2022-11-20 11:51:43,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:43,233 INFO L225 Difference]: With dead ends: 181 [2022-11-20 11:51:43,233 INFO L226 Difference]: Without dead ends: 181 [2022-11-20 11:51:43,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=278, Invalid=2175, Unknown=1, NotChecked=96, Total=2550 [2022-11-20 11:51:43,235 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 512 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 235 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:43,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1301 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1433 Invalid, 0 Unknown, 235 Unchecked, 1.4s Time] [2022-11-20 11:51:43,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-20 11:51:43,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 96. [2022-11-20 11:51:43,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 91 states have internal predecessors, (97), 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) [2022-11-20 11:51:43,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2022-11-20 11:51:43,239 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 48 [2022-11-20 11:51:43,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:43,240 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2022-11-20 11:51:43,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 2.1875) internal successors, (70), 31 states have internal predecessors, (70), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-20 11:51:43,240 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2022-11-20 11:51:43,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-20 11:51:43,241 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:43,241 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] [2022-11-20 11:51:43,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 11:51:43,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:51:43,448 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:51:43,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:43,449 INFO L85 PathProgramCache]: Analyzing trace with hash 2067869775, now seen corresponding path program 1 times [2022-11-20 11:51:43,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:43,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416293216] [2022-11-20 11:51:43,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:43,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:44,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:51:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:44,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:51:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:44,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:51:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:46,208 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 11:51:46,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:46,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416293216] [2022-11-20 11:51:46,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416293216] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:46,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824375656] [2022-11-20 11:51:46,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:46,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:51:46,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:51:46,216 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:51:46,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 11:51:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:46,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 91 conjunts are in the unsatisfiable core [2022-11-20 11:51:46,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:51:46,628 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 [2022-11-20 11:51:47,065 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 [2022-11-20 11:51:47,074 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 [2022-11-20 11:51:47,346 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-20 11:51:47,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 44 [2022-11-20 11:51:47,370 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-20 11:51:47,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 25 [2022-11-20 11:51:47,383 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:51:47,383 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 7 [2022-11-20 11:51:47,630 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_3112 (Array Int Int)) (v_ArrVal_3113 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3113)) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3112) |c_#memory_$Pointer$.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-20 11:51:47,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:47,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:47,698 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:51:47,699 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 78 treesize of output 71 [2022-11-20 11:51:47,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:47,719 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:51:47,719 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 87 treesize of output 83 [2022-11-20 11:51:47,747 INFO L321 Elim1Store]: treesize reduction 34, result has 44.3 percent of original size [2022-11-20 11:51:47,747 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 34 treesize of output 36 [2022-11-20 11:51:47,754 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 44 treesize of output 39 [2022-11-20 11:51:47,957 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-20 11:51:47,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 50 [2022-11-20 11:51:47,971 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-20 11:51:47,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2022-11-20 11:51:48,085 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-20 11:51:48,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:51:48,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824375656] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:48,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:51:48,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 41 [2022-11-20 11:51:48,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721675283] [2022-11-20 11:51:48,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:51:48,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-20 11:51:48,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:48,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-20 11:51:48,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1926, Unknown=1, NotChecked=88, Total=2162 [2022-11-20 11:51:48,656 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 42 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 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) [2022-11-20 11:51:52,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:52,350 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2022-11-20 11:51:52,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 11:51:52,350 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 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 [2022-11-20 11:51:52,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:52,351 INFO L225 Difference]: With dead ends: 146 [2022-11-20 11:51:52,352 INFO L226 Difference]: Without dead ends: 146 [2022-11-20 11:51:52,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=309, Invalid=3476, Unknown=1, NotChecked=120, Total=3906 [2022-11-20 11:51:52,354 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 249 mSDsluCounter, 2058 mSDsCounter, 0 mSdLazyCounter, 2289 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 2160 SdHoareTripleChecker+Invalid, 2533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 224 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:52,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 2160 Invalid, 2533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2289 Invalid, 0 Unknown, 224 Unchecked, 2.1s Time] [2022-11-20 11:51:52,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-20 11:51:52,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 95. [2022-11-20 11:51:52,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.411764705882353) internal successors, (96), 90 states have internal predecessors, (96), 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) [2022-11-20 11:51:52,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2022-11-20 11:51:52,358 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 48 [2022-11-20 11:51:52,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:52,358 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2022-11-20 11:51:52,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 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) [2022-11-20 11:51:52,359 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2022-11-20 11:51:52,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-20 11:51:52,359 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:52,360 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] [2022-11-20 11:51:52,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-20 11:51:52,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:51:52,566 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:51:52,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:52,567 INFO L85 PathProgramCache]: Analyzing trace with hash -645963400, now seen corresponding path program 1 times [2022-11-20 11:51:52,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:52,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150272046] [2022-11-20 11:51:52,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:52,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:52,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:51:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:52,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:51:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:52,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:51:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-20 11:51:52,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:52,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150272046] [2022-11-20 11:51:52,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150272046] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:52,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:51:52,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:51:52,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086893095] [2022-11-20 11:51:52,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:52,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:51:52,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:52,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:51:52,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:51:52,735 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 11:51:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:52,881 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2022-11-20 11:51:52,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:51:52,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2022-11-20 11:51:52,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:52,882 INFO L225 Difference]: With dead ends: 112 [2022-11-20 11:51:52,883 INFO L226 Difference]: Without dead ends: 112 [2022-11-20 11:51:52,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:51:52,884 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 92 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:52,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 188 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:51:52,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-20 11:51:52,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2022-11-20 11:51:52,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 89 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) [2022-11-20 11:51:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2022-11-20 11:51:52,887 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 49 [2022-11-20 11:51:52,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:52,888 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2022-11-20 11:51:52,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 11:51:52,888 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2022-11-20 11:51:52,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-20 11:51:52,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:52,889 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] [2022-11-20 11:51:52,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-20 11:51:52,889 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:51:52,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:52,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1999432508, now seen corresponding path program 1 times [2022-11-20 11:51:52,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:52,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465255098] [2022-11-20 11:51:52,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:52,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:53,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:51:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:53,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:51:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:53,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:51:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:53,281 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 11:51:53,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:53,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465255098] [2022-11-20 11:51:53,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465255098] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:53,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:51:53,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 11:51:53,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483074595] [2022-11-20 11:51:53,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:53,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 11:51:53,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:53,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 11:51:53,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:51:53,284 INFO L87 Difference]: Start difference. First operand 94 states and 101 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) [2022-11-20 11:51:53,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:53,707 INFO L93 Difference]: Finished difference Result 160 states and 173 transitions. [2022-11-20 11:51:53,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 11:51:53,708 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 [2022-11-20 11:51:53,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:53,709 INFO L225 Difference]: With dead ends: 160 [2022-11-20 11:51:53,709 INFO L226 Difference]: Without dead ends: 160 [2022-11-20 11:51:53,709 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 [2022-11-20 11:51:53,710 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 261 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:53,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 421 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:51:53,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-20 11:51:53,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 97. [2022-11-20 11:51:53,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 72 states have (on average 1.375) internal successors, (99), 92 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) [2022-11-20 11:51:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2022-11-20 11:51:53,719 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 51 [2022-11-20 11:51:53,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:53,720 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2022-11-20 11:51:53,720 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) [2022-11-20 11:51:53,720 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2022-11-20 11:51:53,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-20 11:51:53,721 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:53,721 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] [2022-11-20 11:51:53,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-20 11:51:53,721 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:51:53,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:53,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1999432509, now seen corresponding path program 1 times [2022-11-20 11:51:53,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:53,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765661737] [2022-11-20 11:51:53,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:53,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:54,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:51:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:54,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:51:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:54,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:51:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:54,326 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 11:51:54,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:54,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765661737] [2022-11-20 11:51:54,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765661737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:54,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:51:54,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 11:51:54,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406841338] [2022-11-20 11:51:54,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:54,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 11:51:54,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:54,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 11:51:54,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:51:54,330 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 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) [2022-11-20 11:51:54,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:54,713 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2022-11-20 11:51:54,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:51:54,715 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 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 [2022-11-20 11:51:54,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:54,716 INFO L225 Difference]: With dead ends: 146 [2022-11-20 11:51:54,716 INFO L226 Difference]: Without dead ends: 146 [2022-11-20 11:51:54,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-20 11:51:54,717 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 314 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:54,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 425 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:51:54,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-20 11:51:54,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 99. [2022-11-20 11:51:54,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.364864864864865) internal successors, (101), 94 states have internal predecessors, (101), 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) [2022-11-20 11:51:54,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2022-11-20 11:51:54,722 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 51 [2022-11-20 11:51:54,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:54,722 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2022-11-20 11:51:54,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 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) [2022-11-20 11:51:54,722 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2022-11-20 11:51:54,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-20 11:51:54,723 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:54,723 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] [2022-11-20 11:51:54,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-20 11:51:54,724 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:51:54,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:54,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1604261226, now seen corresponding path program 1 times [2022-11-20 11:51:54,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:54,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796380088] [2022-11-20 11:51:54,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:54,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:55,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:51:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:55,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:51:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:55,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:51:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:55,368 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:51:55,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:55,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796380088] [2022-11-20 11:51:55,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796380088] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:55,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920405676] [2022-11-20 11:51:55,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:55,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:51:55,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:51:55,370 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:51:55,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 11:51:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:55,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-20 11:51:55,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:51:56,035 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 [2022-11-20 11:51:56,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:56,187 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 19 [2022-11-20 11:51:56,280 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 [2022-11-20 11:51:56,312 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:51:56,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:51:56,425 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3894 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_20| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_20| v_ArrVal_3894) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (<= 1 .cse0) (not (< |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_20| |c_#StackHeapBarrier|)) (<= (+ .cse0 1) 0)))) is different from false [2022-11-20 11:51:56,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920405676] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:56,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:51:56,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 27 [2022-11-20 11:51:56,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56404125] [2022-11-20 11:51:56,433 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:51:56,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-20 11:51:56,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:56,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-20 11:51:56,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=669, Unknown=1, NotChecked=52, Total=812 [2022-11-20 11:51:56,439 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 27 states, 25 states have (on average 2.72) internal successors, (68), 22 states have internal predecessors, (68), 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) [2022-11-20 11:51:57,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:57,266 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2022-11-20 11:51:57,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 11:51:57,267 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.72) internal successors, (68), 22 states have internal predecessors, (68), 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 [2022-11-20 11:51:57,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:57,267 INFO L225 Difference]: With dead ends: 90 [2022-11-20 11:51:57,268 INFO L226 Difference]: Without dead ends: 90 [2022-11-20 11:51:57,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=186, Invalid=1077, Unknown=1, NotChecked=68, Total=1332 [2022-11-20 11:51:57,269 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 526 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:57,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 689 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 11:51:57,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-20 11:51:57,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-11-20 11:51:57,271 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) [2022-11-20 11:51:57,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2022-11-20 11:51:57,272 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 53 [2022-11-20 11:51:57,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:57,272 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2022-11-20 11:51:57,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.72) internal successors, (68), 22 states have internal predecessors, (68), 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) [2022-11-20 11:51:57,273 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2022-11-20 11:51:57,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-20 11:51:57,273 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:57,273 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] [2022-11-20 11:51:57,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-20 11:51:57,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-20 11:51:57,480 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:51:57,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:57,480 INFO L85 PathProgramCache]: Analyzing trace with hash -696733545, now seen corresponding path program 1 times [2022-11-20 11:51:57,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:57,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278597037] [2022-11-20 11:51:57,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:57,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:58,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:51:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:58,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:51:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:58,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:51:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:58,829 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 11:51:58,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:58,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278597037] [2022-11-20 11:51:58,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278597037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:58,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:51:58,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-20 11:51:58,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971808759] [2022-11-20 11:51:58,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:58,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 11:51:58,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:58,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 11:51:58,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-11-20 11:51:58,841 INFO L87 Difference]: Start difference. First operand 90 states and 96 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) [2022-11-20 11:51:59,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:59,566 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2022-11-20 11:51:59,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 11:51:59,568 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 [2022-11-20 11:51:59,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:59,569 INFO L225 Difference]: With dead ends: 107 [2022-11-20 11:51:59,569 INFO L226 Difference]: Without dead ends: 107 [2022-11-20 11:51:59,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2022-11-20 11:51:59,570 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 293 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:59,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 534 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 11:51:59,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-20 11:51:59,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 89. [2022-11-20 11:51:59,572 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) [2022-11-20 11:51:59,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2022-11-20 11:51:59,573 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 54 [2022-11-20 11:51:59,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:59,573 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2022-11-20 11:51:59,573 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) [2022-11-20 11:51:59,574 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2022-11-20 11:51:59,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-20 11:51:59,574 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:59,574 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] [2022-11-20 11:51:59,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-20 11:51:59,574 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:51:59,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:59,578 INFO L85 PathProgramCache]: Analyzing trace with hash -696733544, now seen corresponding path program 1 times [2022-11-20 11:51:59,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:59,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607207049] [2022-11-20 11:51:59,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:59,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:00,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:52:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:00,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:52:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:00,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:52:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:01,307 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:52:01,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:52:01,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607207049] [2022-11-20 11:52:01,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607207049] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:52:01,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:52:01,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-11-20 11:52:01,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437060701] [2022-11-20 11:52:01,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:52:01,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-20 11:52:01,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:52:01,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-20 11:52:01,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2022-11-20 11:52:01,309 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 22 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 11:52:02,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:52:02,338 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2022-11-20 11:52:02,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 11:52:02,339 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2022-11-20 11:52:02,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:52:02,340 INFO L225 Difference]: With dead ends: 88 [2022-11-20 11:52:02,340 INFO L226 Difference]: Without dead ends: 88 [2022-11-20 11:52:02,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=181, Invalid=875, Unknown=0, NotChecked=0, Total=1056 [2022-11-20 11:52:02,341 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 565 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:52:02,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 461 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 11:52:02,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-20 11:52:02,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-11-20 11:52:02,343 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) [2022-11-20 11:52:02,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2022-11-20 11:52:02,344 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 54 [2022-11-20 11:52:02,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:52:02,344 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2022-11-20 11:52:02,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 11:52:02,345 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-11-20 11:52:02,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 11:52:02,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:52:02,345 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] [2022-11-20 11:52:02,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-20 11:52:02,346 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:52:02,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:52:02,346 INFO L85 PathProgramCache]: Analyzing trace with hash -833520442, now seen corresponding path program 1 times [2022-11-20 11:52:02,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:52:02,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010907219] [2022-11-20 11:52:02,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:52:02,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:52:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:03,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:52:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:03,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:52:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:03,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:52:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 11:52:03,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:52:03,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010907219] [2022-11-20 11:52:03,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010907219] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:52:03,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601457489] [2022-11-20 11:52:03,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:52:03,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:52:03,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:52:03,763 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:52:03,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 11:52:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:04,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-20 11:52:04,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:52:04,453 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 [2022-11-20 11:52:04,809 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 [2022-11-20 11:52:05,070 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-20 11:52:05,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 15 [2022-11-20 11:52:05,077 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 [2022-11-20 11:52:05,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:05,631 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:52:05,631 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 44 treesize of output 48 [2022-11-20 11:52:05,663 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-20 11:52:05,663 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 21 treesize of output 29 [2022-11-20 11:52:05,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:05,681 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 26 treesize of output 28 [2022-11-20 11:52:06,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-20 11:52:06,472 INFO L321 Elim1Store]: treesize reduction 64, result has 22.0 percent of original size [2022-11-20 11:52:06,473 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 58 treesize of output 69 [2022-11-20 11:52:06,484 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 21 treesize of output 13 [2022-11-20 11:52:06,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:06,609 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 33 treesize of output 31 [2022-11-20 11:52:06,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:06,663 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 33 treesize of output 31 [2022-11-20 11:52:06,954 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:52:06,954 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 37 treesize of output 36 [2022-11-20 11:52:07,119 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 34 treesize of output 18 [2022-11-20 11:52:07,263 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:52:07,263 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:52:07,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601457489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:52:07,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:52:07,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [20] total 48 [2022-11-20 11:52:07,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579227492] [2022-11-20 11:52:07,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:52:07,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-20 11:52:07,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:52:07,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-20 11:52:07,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2163, Unknown=1, NotChecked=0, Total=2352 [2022-11-20 11:52:07,265 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 30 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 11:52:07,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:52:07,939 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2022-11-20 11:52:07,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 11:52:07,939 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 59 [2022-11-20 11:52:07,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:52:07,940 INFO L225 Difference]: With dead ends: 89 [2022-11-20 11:52:07,940 INFO L226 Difference]: Without dead ends: 89 [2022-11-20 11:52:07,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=255, Invalid=2714, Unknown=1, NotChecked=0, Total=2970 [2022-11-20 11:52:07,942 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 41 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 301 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:52:07,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 608 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 281 Invalid, 0 Unknown, 301 Unchecked, 0.3s Time] [2022-11-20 11:52:07,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-20 11:52:07,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-11-20 11:52:07,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 84 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) [2022-11-20 11:52:07,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2022-11-20 11:52:07,945 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 59 [2022-11-20 11:52:07,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:52:07,945 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2022-11-20 11:52:07,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 11:52:07,946 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2022-11-20 11:52:07,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 11:52:07,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:52:07,946 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] [2022-11-20 11:52:07,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-20 11:52:08,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-20 11:52:08,147 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:52:08,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:52:08,148 INFO L85 PathProgramCache]: Analyzing trace with hash -833520441, now seen corresponding path program 1 times [2022-11-20 11:52:08,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:52:08,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863635367] [2022-11-20 11:52:08,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:52:08,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:52:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:10,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:52:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:10,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:52:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:10,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:52:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:52:11,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:52:11,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863635367] [2022-11-20 11:52:11,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863635367] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:52:11,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431542551] [2022-11-20 11:52:11,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:52:11,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:52:11,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:52:11,620 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:52:11,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 11:52:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:12,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 114 conjunts are in the unsatisfiable core [2022-11-20 11:52:12,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:52:12,020 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 [2022-11-20 11:52:12,069 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 [2022-11-20 11:52:12,193 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:52:12,194 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 [2022-11-20 11:52:12,304 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 [2022-11-20 11:52:12,835 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 [2022-11-20 11:52:13,149 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:52:13,149 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 [2022-11-20 11:52:13,158 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 [2022-11-20 11:52:13,170 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 [2022-11-20 11:52:13,174 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 [2022-11-20 11:52:13,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:13,774 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:52:13,774 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 [2022-11-20 11:52:13,798 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 11:52:13,799 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 [2022-11-20 11:52:13,820 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 11:52:13,821 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 [2022-11-20 11:52:13,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:13,835 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 [2022-11-20 11:52:14,669 INFO L321 Elim1Store]: treesize reduction 64, result has 22.0 percent of original size [2022-11-20 11:52:14,669 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 79 treesize of output 84 [2022-11-20 11:52:14,695 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:52:14,695 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 48 [2022-11-20 11:52:14,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:52:14,710 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 22 treesize of output 12 [2022-11-20 11:52:14,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:14,852 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 [2022-11-20 11:52:14,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:14,871 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 33 treesize of output 31 [2022-11-20 11:52:14,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:14,933 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 [2022-11-20 11:52:14,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:14,942 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 33 treesize of output 31 [2022-11-20 11:52:15,202 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:52:15,203 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 39 treesize of output 38 [2022-11-20 11:52:15,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:15,212 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 [2022-11-20 11:52:15,335 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 [2022-11-20 11:52:15,345 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 [2022-11-20 11:52:15,476 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:52:15,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:52:15,709 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4814 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_4815) |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| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_4814) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_4815 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-20 11:52:15,723 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_4815 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4814 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4815) |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| .cse0 v_ArrVal_4814) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-20 11:52:15,747 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4812) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4813) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4814 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4813))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4812) .cse0 v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_4814) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-20 11:52:15,792 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4808 (Array Int Int)) (v_ArrVal_4809 (Array Int Int)) (v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4814 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_4808) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4813))) (let ((.cse0 (select (select .cse1 |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| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_4809) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4812) .cse0 v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_4814) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (forall ((v_ArrVal_4808 (Array Int Int)) (v_ArrVal_4809 (Array Int Int)) (v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_4809) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4812) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_4808) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4813) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-20 11:52:15,811 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4808 (Array Int Int)) (v_ArrVal_4809 (Array Int Int)) (v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4814 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_4808) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4813))) (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 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_4809) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4812) .cse0 v_ArrVal_4815) |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_4814) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (forall ((v_ArrVal_4808 (Array Int Int)) (v_ArrVal_4809 (Array Int Int)) (v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_4809) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4812) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_4808) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4813) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2022-11-20 11:52:16,368 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)))) (and (forall ((v_ArrVal_4808 (Array Int Int)) (v_ArrVal_4809 (Array Int Int)) (v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4809) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4812) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4808) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4813) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4808 (Array Int Int)) (v_ArrVal_4809 (Array Int Int)) (v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4814 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4808) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4813))) (let ((.cse1 (select (select .cse2 |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 v_ArrVal_4809) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4812) .cse1 v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_4814) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-20 11:52:16,420 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)))) (and (forall ((v_ArrVal_4808 (Array Int Int)) (v_ArrVal_4809 (Array Int Int)) (v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4809) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4812) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4808) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4813) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4808 (Array Int Int)) (v_ArrVal_4809 (Array Int Int)) (v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4814 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4808) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4813))) (let ((.cse1 (select (select .cse2 |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 v_ArrVal_4809) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4812) .cse1 v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_4814) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-20 11:52:16,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431542551] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:52:16,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:52:16,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 31] total 56 [2022-11-20 11:52:16,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128634571] [2022-11-20 11:52:16,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:52:16,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-20 11:52:16,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:52:16,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-20 11:52:16,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=3535, Unknown=32, NotChecked=882, Total=4692 [2022-11-20 11:52:16,876 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 57 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 49 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) [2022-11-20 11:52:21,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:52:21,368 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2022-11-20 11:52:21,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 11:52:21,369 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 49 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 [2022-11-20 11:52:21,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:52:21,370 INFO L225 Difference]: With dead ends: 112 [2022-11-20 11:52:21,370 INFO L226 Difference]: Without dead ends: 112 [2022-11-20 11:52:21,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1513 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=525, Invalid=5950, Unknown=33, NotChecked=1148, Total=7656 [2022-11-20 11:52:21,373 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 538 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 1903 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:52:21,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1169 Invalid, 2002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1903 Invalid, 0 Unknown, 64 Unchecked, 1.7s Time] [2022-11-20 11:52:21,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-20 11:52:21,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2022-11-20 11:52:21,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 86 states have internal predecessors, (92), 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) [2022-11-20 11:52:21,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2022-11-20 11:52:21,377 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 59 [2022-11-20 11:52:21,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:52:21,377 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2022-11-20 11:52:21,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 49 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) [2022-11-20 11:52:21,378 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2022-11-20 11:52:21,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-20 11:52:21,378 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:52:21,378 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] [2022-11-20 11:52:21,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-20 11:52:21,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-20 11:52:21,583 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:52:21,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:52:21,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2145741940, now seen corresponding path program 1 times [2022-11-20 11:52:21,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:52:21,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296261606] [2022-11-20 11:52:21,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:52:21,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:52:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:24,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:52:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:24,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:52:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:24,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:52:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:25,744 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:52:25,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:52:25,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296261606] [2022-11-20 11:52:25,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296261606] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:52:25,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180927661] [2022-11-20 11:52:25,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:52:25,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:52:25,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:52:25,747 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:52:25,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-20 11:52:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:26,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 153 conjunts are in the unsatisfiable core [2022-11-20 11:52:26,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:52:26,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 [2022-11-20 11:52:26,295 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 [2022-11-20 11:52:26,504 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from false [2022-11-20 11:52:26,506 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from true [2022-11-20 11:52:26,536 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_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from false [2022-11-20 11:52:26,539 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_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from true [2022-11-20 11:52:26,610 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-20 11:52:26,613 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-20 11:52:26,659 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-20 11:52:26,662 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-20 11:52:26,828 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 [2022-11-20 11:52:26,838 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| (select (select |c_#memory_int| |c_node_create_~temp~0#1.base|) (+ 8 |c_node_create_~temp~0#1.offset|))) (= |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) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-20 11:52:26,841 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| (select (select |c_#memory_int| |c_node_create_~temp~0#1.base|) (+ 8 |c_node_create_~temp~0#1.offset|))) (= |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) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-20 11:52:26,889 WARN L837 $PredicateComparison]: unable to prove that (and (= |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) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) (+ |c_node_create_#res#1.offset| 8)) |c_node_create_#in~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-20 11:52:26,892 WARN L859 $PredicateComparison]: unable to prove that (and (= |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) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) (+ |c_node_create_#res#1.offset| 8)) |c_node_create_#in~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-20 11:52:27,068 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 8)) (= |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_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-20 11:52:27,072 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 8)) (= |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_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-20 11:52:27,172 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~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|) (= |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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-20 11:52:27,177 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~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|) (= |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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-20 11:52:27,199 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 19 treesize of output 18 [2022-11-20 11:52:27,424 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:52:27,425 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 14 treesize of output 20 [2022-11-20 11:52:27,440 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 [2022-11-20 11:52:27,472 WARN L837 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8))) (< |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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-20 11:52:27,476 WARN L859 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8))) (< |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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-20 11:52:27,607 WARN L837 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) (< |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_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-20 11:52:27,611 WARN L859 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) (< |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_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-20 11:52:27,740 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:52:27,740 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 24 [2022-11-20 11:52:27,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:27,806 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 25 treesize of output 24 [2022-11-20 11:52:27,815 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 [2022-11-20 11:52:27,881 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 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) (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| .cse0)) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)))))) is different from false [2022-11-20 11:52:27,884 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 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) (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| .cse0)) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)))))) is different from true [2022-11-20 11:52:27,994 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (and (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0)) (< |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_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_43| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (< |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))))) is different from false [2022-11-20 11:52:27,999 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (and (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0)) (< |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_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_43| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (< |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))))) is different from true [2022-11-20 11:52:28,110 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 ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 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) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse0) 8)) (= .cse1 .cse0)) (= |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_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| .cse0 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse1) 0))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))))) is different from false [2022-11-20 11:52:28,115 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 ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 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) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse0) 8)) (= .cse1 .cse0)) (= |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_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| .cse0 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse1) 0))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))))) is different from true [2022-11-20 11:52:28,139 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:52:28,140 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 70 treesize of output 33 [2022-11-20 11:52:28,149 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 11 treesize of output 7 [2022-11-20 11:52:28,158 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 [2022-11-20 11:52:28,235 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-20 11:52:28,240 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-20 11:52:28,328 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)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-20 11:52:28,332 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)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-20 11:52:28,479 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (exists ((v_ArrVal_5124 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5124))) (exists ((v_ArrVal_5122 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5122) |c_#memory_int|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_5123 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5123) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-20 11:52:28,483 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (exists ((v_ArrVal_5124 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5124))) (exists ((v_ArrVal_5122 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5122) |c_#memory_int|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_5123 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5123) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-20 11:52:28,563 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (exists ((v_ArrVal_5125 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5125) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5127 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5127) |c_#memory_int|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((v_ArrVal_5126 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5126) |c_#memory_$Pointer$.base|))) is different from false [2022-11-20 11:52:28,567 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (exists ((v_ArrVal_5125 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5125) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5127 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5127) |c_#memory_int|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((v_ArrVal_5126 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5126) |c_#memory_$Pointer$.base|))) is different from true [2022-11-20 11:52:28,639 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (exists ((v_ArrVal_5128 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5128) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5130 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5130) |c_#memory_int|)) (exists ((v_ArrVal_5129 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5129) |c_#memory_$Pointer$.offset|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-20 11:52:28,643 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (exists ((v_ArrVal_5128 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5128) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5130 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5130) |c_#memory_int|)) (exists ((v_ArrVal_5129 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5129) |c_#memory_$Pointer$.offset|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-20 11:52:28,722 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5130 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_#res#1.base| v_ArrVal_5130) |c_#memory_int|)) (exists ((v_ArrVal_5129 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_5129))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((v_ArrVal_5128 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_5128) |c_#memory_$Pointer$.base|))) is different from false [2022-11-20 11:52:28,726 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5130 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_#res#1.base| v_ArrVal_5130) |c_#memory_int|)) (exists ((v_ArrVal_5129 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_5129))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((v_ArrVal_5128 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_5128) |c_#memory_$Pointer$.base|))) is different from true [2022-11-20 11:52:28,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:28,833 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 [2022-11-20 11:52:28,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:28,885 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:52:28,885 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 108 treesize of output 90 [2022-11-20 11:52:28,947 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 11:52:28,947 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 34 treesize of output 44 [2022-11-20 11:52:28,959 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 [2022-11-20 11:52:29,173 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 ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (+ 2 .cse3))) (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .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_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 1) (= (select (store |v_#valid_BEFORE_CALL_28| .cse3 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse4) 0))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 8)) (= .cse4 .cse3) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse3)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse5 (select |v_#valid_BEFORE_CALL_27| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)))))))) is different from false [2022-11-20 11:52:29,180 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 ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (+ 2 .cse3))) (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .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_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 1) (= (select (store |v_#valid_BEFORE_CALL_28| .cse3 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse4) 0))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 8)) (= .cse4 .cse3) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse3)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse5 (select |v_#valid_BEFORE_CALL_27| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)))))))) is different from true [2022-11-20 11:52:29,515 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (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 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse6 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))))) is different from false [2022-11-20 11:52:29,521 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (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 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse6 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))))) is different from true [2022-11-20 11:52:30,287 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (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 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (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|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |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|)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse6 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))))) is different from false [2022-11-20 11:52:30,294 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (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 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (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|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |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|)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse6 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))))) is different from true [2022-11-20 11:52:30,588 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (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 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (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))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse6 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))))) is different from false [2022-11-20 11:52:30,595 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (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 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (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))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse6 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))))) is different from true [2022-11-20 11:52:30,873 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (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 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse3 |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))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse6 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))))) is different from false [2022-11-20 11:52:30,879 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (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 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse3 |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))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse6 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))))) is different from true [2022-11-20 11:52:31,033 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2022-11-20 11:52:31,034 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 169 treesize of output 142 [2022-11-20 11:52:31,084 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:52:31,085 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 53 [2022-11-20 11:52:31,113 INFO L321 Elim1Store]: treesize reduction 31, result has 48.3 percent of original size [2022-11-20 11:52:31,113 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 53 treesize of output 75 [2022-11-20 11:52:31,139 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 [2022-11-20 11:52:31,317 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse7 (select (select |c_#memory_$Pointer$.base| (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse6 (select |v_#valid_BEFORE_CALL_28| .cse6)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse7) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |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) (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse7 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-20 11:52:31,323 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse7 (select (select |c_#memory_$Pointer$.base| (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse6 (select |v_#valid_BEFORE_CALL_28| .cse6)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse7) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |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) (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse7 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-20 11:52:31,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:31,442 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:52:31,443 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 134 treesize of output 108 [2022-11-20 11:52:31,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:31,549 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 [2022-11-20 11:52:31,600 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 11:52:31,600 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 41 treesize of output 51 [2022-11-20 11:52:31,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:31,955 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:52:31,956 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 134 treesize of output 108 [2022-11-20 11:52:31,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:31,987 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 41 treesize of output 43 [2022-11-20 11:52:32,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:32,016 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 [2022-11-20 11:52:32,366 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse0 (+ 2 .cse1))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (= |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_main_~data~0#1| 1) (= |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) (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse5 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse6 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= (select (store |v_#valid_BEFORE_CALL_28| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse2) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))))))) is different from false [2022-11-20 11:52:32,372 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse0 (+ 2 .cse1))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (= |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_main_~data~0#1| 1) (= |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) (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse5 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse6 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= (select (store |v_#valid_BEFORE_CALL_28| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse2) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))))))) is different from true [2022-11-20 11:52:32,935 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)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select (store |v_#valid_BEFORE_CALL_28| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))) (<= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse8) (or (= .cse8 0) (= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-20 11:52:32,940 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)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select (store |v_#valid_BEFORE_CALL_28| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))) (<= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse8) (or (= .cse8 0) (= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-20 11:52:33,063 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:52:33,064 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 146 treesize of output 115 [2022-11-20 11:52:33,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:33,096 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 33 treesize of output 28 [2022-11-20 11:52:33,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:33,129 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 26 [2022-11-20 11:52:33,152 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 28 treesize of output 22 [2022-11-20 11:52:33,427 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 ((.cse0 (+ 2 .cse3))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (v_arrayElimCell_147 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_147) 0) (= (select (store |v_#valid_BEFORE_CALL_28| .cse3 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_147) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |v_#valid_BEFORE_CALL_31| .cse6))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 8)) (= (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_main_~data~0#1| 1)))) is different from false [2022-11-20 11:52:33,432 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 ((.cse0 (+ 2 .cse3))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (v_arrayElimCell_147 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_147) 0) (= (select (store |v_#valid_BEFORE_CALL_28| .cse3 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_147) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |v_#valid_BEFORE_CALL_31| .cse6))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 8)) (= (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_main_~data~0#1| 1)))) is different from true [2022-11-20 11:52:33,943 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 67 treesize of output 39 [2022-11-20 11:52:33,963 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 [2022-11-20 11:52:34,233 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_#t~mem16#1.base|) 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (v_arrayElimCell_147 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_#t~mem16#1.base| 2)) (.cse2 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_147) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_old(#valid)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_#t~mem16#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_147) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_#t~mem16#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse5 (select |v_#valid_BEFORE_CALL_31| .cse5))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-20 11:52:34,238 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_#t~mem16#1.base|) 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (v_arrayElimCell_147 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_#t~mem16#1.base| 2)) (.cse2 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_147) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_old(#valid)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_#t~mem16#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_147) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_#t~mem16#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse5 (select |v_#valid_BEFORE_CALL_31| .cse5))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-20 11:52:34,553 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (v_arrayElimCell_147 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2)) (.cse3 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_147) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_old(#valid)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_147) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse5 (select |v_#valid_BEFORE_CALL_31| .cse5))) |v_#valid_BEFORE_CALL_31|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2022-11-20 11:52:34,557 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (v_arrayElimCell_147 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2)) (.cse3 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_147) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_old(#valid)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_147) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse5 (select |v_#valid_BEFORE_CALL_31| .cse5))) |v_#valid_BEFORE_CALL_31|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2022-11-20 11:52:34,608 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 [2022-11-20 11:52:34,672 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2022-11-20 11:52:34,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:52:34,853 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5140 Int) (v_ArrVal_5142 (Array Int Int)) (v_ArrVal_5141 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) v_ArrVal_5140)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_5141) |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_5142) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2022-11-20 11:52:35,379 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5140 Int) (v_ArrVal_5142 (Array Int Int)) (v_ArrVal_5138 (Array Int Int)) (v_ArrVal_5137 (Array Int Int)) (v_ArrVal_5139 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| Int) (v_ArrVal_5141 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5139))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5138))) (let ((.cse1 (select (select .cse2 |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_5137))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| 4) v_ArrVal_5140))) (select (select (store .cse2 .cse1 v_ArrVal_5141) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse3 .cse1 v_ArrVal_5142) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))) is different from false [2022-11-20 11:52:35,429 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5132 (Array Int Int)) (v_ArrVal_5131 (Array Int Int)) (v_ArrVal_5140 Int) (v_ArrVal_5142 (Array Int Int)) (v_ArrVal_5133 (Array Int Int)) (v_ArrVal_5138 (Array Int Int)) (v_ArrVal_5137 (Array Int Int)) (v_ArrVal_5139 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| Int) (v_ArrVal_5141 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5132) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5139))) (or (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= |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_5131) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5138))) (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 (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5133) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5137))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| 4) v_ArrVal_5140))) (select (select (store .cse3 .cse2 v_ArrVal_5141) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store .cse0 .cse2 v_ArrVal_5142) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) is different from false [2022-11-20 11:52:35,454 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5132 (Array Int Int)) (v_ArrVal_5131 (Array Int Int)) (v_ArrVal_5140 Int) (v_ArrVal_5142 (Array Int Int)) (v_ArrVal_5133 (Array Int Int)) (v_ArrVal_5138 (Array Int Int)) (v_ArrVal_5137 (Array Int Int)) (v_ArrVal_5139 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| Int) (v_ArrVal_5141 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_5132) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5139))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_5131) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5138))) (let ((.cse1 (select (select .cse2 |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_5133) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5137))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| 4) v_ArrVal_5140))) (select (select (store .cse2 .cse1 v_ArrVal_5141) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse3 .cse1 v_ArrVal_5142) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))) is different from false [2022-11-20 11:52:35,510 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5132 (Array Int Int)) (v_ArrVal_5131 (Array Int Int)) (v_ArrVal_5140 Int) (v_ArrVal_5142 (Array Int Int)) (v_ArrVal_5133 (Array Int Int)) (v_ArrVal_5138 (Array Int Int)) (v_ArrVal_5137 (Array Int Int)) (v_ArrVal_5139 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| Int) (v_ArrVal_5141 (Array Int Int))) (let ((.cse2 (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$.offset| .cse2 v_ArrVal_5132) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5139))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_5131) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5138))) (let ((.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| .cse2 v_ArrVal_5133) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5137))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| 4) v_ArrVal_5140))) (select (select (store .cse3 .cse1 v_ArrVal_5141) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse4 .cse1 v_ArrVal_5142) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))))))) is different from false [2022-11-20 11:52:35,542 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5132 (Array Int Int)) (v_ArrVal_5131 (Array Int Int)) (v_ArrVal_5140 Int) (v_ArrVal_5142 (Array Int Int)) (v_ArrVal_5133 (Array Int Int)) (v_ArrVal_5138 (Array Int Int)) (v_ArrVal_5137 (Array Int Int)) (v_ArrVal_5139 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| Int) (v_ArrVal_5141 (Array Int Int))) (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 ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_5132) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5139))) (or (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_5131) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5138))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse1 (store (store |c_#memory_int| .cse3 v_ArrVal_5133) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5137))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| 4) v_ArrVal_5140))) (select (select (store .cse4 .cse2 v_ArrVal_5141) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse0 .cse2 v_ArrVal_5142) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))))))) is different from false [2022-11-20 11:52:35,608 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5132 (Array Int Int)) (v_ArrVal_5131 (Array Int Int)) (v_ArrVal_5140 Int) (v_ArrVal_5142 (Array Int Int)) (v_ArrVal_5133 (Array Int Int)) (v_ArrVal_5138 (Array Int Int)) (v_ArrVal_5137 (Array Int Int)) (v_ArrVal_5139 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| Int) (v_ArrVal_5141 (Array Int Int))) (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 ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_5132) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5139))) (or (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_5131) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5138))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse1 (store (store |c_#memory_int| .cse3 v_ArrVal_5133) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5137))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| 4) v_ArrVal_5140))) (select (select (store .cse4 .cse2 v_ArrVal_5141) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store .cse0 .cse2 v_ArrVal_5142) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2022-11-20 11:52:35,753 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| Int) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| Int) (v_ArrVal_5141 (Array Int Int)) (v_ArrVal_5132 (Array Int Int)) (v_ArrVal_5131 (Array Int Int)) (v_ArrVal_5140 Int) (v_ArrVal_5142 (Array Int Int)) (v_ArrVal_5156 (Array Int Int)) (v_ArrVal_5133 (Array Int Int)) (v_ArrVal_5158 (Array Int Int)) (v_ArrVal_5157 (Array Int Int)) (v_ArrVal_5138 (Array Int Int)) (v_ArrVal_5137 (Array Int Int)) (v_ArrVal_5139 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_5157)) (.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_5156))) (let ((.cse2 (select (select .cse5 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select .cse6 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse4 (store (store .cse6 .cse2 v_ArrVal_5132) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_5139))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27|) 0)) (not (< |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store .cse5 .cse2 v_ArrVal_5131) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_5138))) (let ((.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 (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_5158) .cse2 v_ArrVal_5133) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_5137))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| 4) v_ArrVal_5140))) (select (select (store .cse3 .cse1 v_ArrVal_5141) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse4 .cse1 v_ArrVal_5142) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))))) is different from false [2022-11-20 11:52:35,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180927661] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:52:35,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:52:35,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 69 [2022-11-20 11:52:35,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615853201] [2022-11-20 11:52:35,756 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:52:35,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-11-20 11:52:35,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:52:35,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-11-20 11:52:35,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1665, Unknown=75, NotChecked=4522, Total=6480 [2022-11-20 11:52:35,759 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 69 states, 65 states have (on average 1.6) internal successors, (104), 59 states have internal predecessors, (104), 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) [2022-11-20 11:52:36,336 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|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0))) (= |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|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from false [2022-11-20 11:52:36,338 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|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0))) (= |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|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from true [2022-11-20 11:52:36,342 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_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) is different from false [2022-11-20 11:52:36,344 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_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) is different from true [2022-11-20 11:52:36,349 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)|) (= |c_old(#length)| |c_#length|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-20 11:52:36,352 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)|) (= |c_old(#length)| |c_#length|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-20 11:52:36,356 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_old(#memory_int)| |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-20 11:52:36,359 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_old(#memory_int)| |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-20 11:52:36,364 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |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)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from false [2022-11-20 11:52:36,367 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |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)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from true [2022-11-20 11:52:36,373 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (= (select .cse0 8) |c_node_create_#in~data#1|) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| (select .cse0 (+ 8 |c_node_create_~temp~0#1.offset|))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| .cse0) |c_#memory_int|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= .cse1 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from false [2022-11-20 11:52:36,376 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (= (select .cse0 8) |c_node_create_#in~data#1|) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| (select .cse0 (+ 8 |c_node_create_~temp~0#1.offset|))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| .cse0) |c_#memory_int|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= .cse1 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from true [2022-11-20 11:52:36,391 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| .cse3 (select |c_#memory_$Pointer$.offset| .cse3)))) (let ((.cse9 (@diff .cse8 |c_#memory_$Pointer$.offset|))) (let ((.cse1 (store .cse8 .cse9 (select |c_#memory_$Pointer$.offset| .cse9)))) (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff .cse1 |c_#memory_$Pointer$.offset|)) (.cse4 (select |c_#memory_int| |c_node_create_#res#1.base|)) (.cse6 (@diff |c_old(#memory_int)| |c_#memory_int|))) (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$.offset| .cse1) (= (select |c_old(#valid)| .cse2) 0)) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (or (= (select |c_old(#valid)| .cse3) 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (= (select .cse4 8) |c_node_create_#in~data#1|) (= |c_#memory_$Pointer$.offset| (store .cse1 .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (= |c_#valid| (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse5 (select |c_#valid| .cse5)))) (= (store |c_old(#memory_int)| .cse6 (select |c_#memory_int| .cse6)) |c_#memory_int|) (= (select .cse4 (+ |c_node_create_#res#1.offset| 8)) |c_node_create_#in~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (or (= |c_old(#memory_int)| |c_#memory_int|) (= .cse6 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$.offset| .cse8) (= (select |c_old(#valid)| .cse9) 0)))))))) is different from false [2022-11-20 11:52:36,399 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| .cse3 (select |c_#memory_$Pointer$.offset| .cse3)))) (let ((.cse9 (@diff .cse8 |c_#memory_$Pointer$.offset|))) (let ((.cse1 (store .cse8 .cse9 (select |c_#memory_$Pointer$.offset| .cse9)))) (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff .cse1 |c_#memory_$Pointer$.offset|)) (.cse4 (select |c_#memory_int| |c_node_create_#res#1.base|)) (.cse6 (@diff |c_old(#memory_int)| |c_#memory_int|))) (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$.offset| .cse1) (= (select |c_old(#valid)| .cse2) 0)) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (or (= (select |c_old(#valid)| .cse3) 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (= (select .cse4 8) |c_node_create_#in~data#1|) (= |c_#memory_$Pointer$.offset| (store .cse1 .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (= |c_#valid| (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse5 (select |c_#valid| .cse5)))) (= (store |c_old(#memory_int)| .cse6 (select |c_#memory_int| .cse6)) |c_#memory_int|) (= (select .cse4 (+ |c_node_create_#res#1.offset| 8)) |c_node_create_#in~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (or (= |c_old(#memory_int)| |c_#memory_int|) (= .cse6 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$.offset| .cse8) (= (select |c_old(#valid)| .cse9) 0)))))))) is different from true [2022-11-20 11:52:36,410 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (< |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_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 8)) (= |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|) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-11-20 11:52:36,414 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (< |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_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 8)) (= |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|) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-11-20 11:52:36,428 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |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) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 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) (= |c_ULTIMATE.start_main_~data~0#1| 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_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (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 [2022-11-20 11:52:36,432 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |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) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 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) (= |c_ULTIMATE.start_main_~data~0#1| 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_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (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 [2022-11-20 11:52:36,447 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8))) (.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (or .cse0 .cse1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (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 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 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) (= |c_ULTIMATE.start_main_~data~0#1| 1) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not .cse0))) is different from false [2022-11-20 11:52:36,451 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8))) (.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (or .cse0 .cse1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (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 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 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) (= |c_ULTIMATE.start_main_~data~0#1| 1) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not .cse0))) is different from true [2022-11-20 11:52:36,464 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8)))) (and (or .cse0 .cse1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (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 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (not .cse0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) .cse1)) is different from false [2022-11-20 11:52:36,468 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8)))) (and (or .cse0 .cse1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (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 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (not .cse0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) .cse1)) is different from true [2022-11-20 11:52:36,485 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (let ((.cse0 (= .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (or .cse0 .cse1) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (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_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| .cse2)) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)))) .cse1))) is different from false [2022-11-20 11:52:36,489 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (let ((.cse0 (= .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (or .cse0 .cse1) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (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_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| .cse2)) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)))) .cse1))) is different from true [2022-11-20 11:52:36,504 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 8))) (.cse1 (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse2))) (and (or .cse0 .cse1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_43| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (not .cse1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)) (< |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|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse4 (select |v_#valid_BEFORE_CALL_27| .cse4)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))))) is different from false [2022-11-20 11:52:36,508 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 8))) (.cse1 (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse2))) (and (or .cse0 .cse1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_43| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (not .cse1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)) (< |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|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse4 (select |v_#valid_BEFORE_CALL_27| .cse4)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))))) is different from true [2022-11-20 11:52:36,521 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 ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse0 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse2) 8))) (.cse1 (= .cse3 .cse2))) (and .cse0 (< |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) (or .cse0 .cse1) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse2)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (< .cse2 |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not .cse1) (not (= (select |c_#valid| .cse2) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| .cse2 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse3) 0))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse5 (select |v_#valid_BEFORE_CALL_27| .cse5)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))))))) is different from false [2022-11-20 11:52:36,526 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 ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse0 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse2) 8))) (.cse1 (= .cse3 .cse2))) (and .cse0 (< |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) (or .cse0 .cse1) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse2)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (< .cse2 |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not .cse1) (not (= (select |c_#valid| .cse2) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| .cse2 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse3) 0))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse5 (select |v_#valid_BEFORE_CALL_27| .cse5)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))))))) is different from true [2022-11-20 11:52:36,538 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |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|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-20 11:52:36,542 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |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|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-20 11:52:36,555 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)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#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) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-20 11:52:36,559 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)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#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) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-20 11:52:36,576 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) |c_#memory_int|) (exists ((v_ArrVal_5124 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5124))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_5122 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5122) |c_#memory_int|)) (= .cse1 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_5123 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5123) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from false [2022-11-20 11:52:36,582 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) |c_#memory_int|) (exists ((v_ArrVal_5124 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5124))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_5122 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5122) |c_#memory_int|)) (= .cse1 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_5123 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5123) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from true [2022-11-20 11:52:36,595 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) |c_#memory_int|) (exists ((v_ArrVal_5125 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5125) |c_#memory_$Pointer$.offset|)) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_5127 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5127) |c_#memory_int|)) (= .cse1 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((v_ArrVal_5126 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5126) |c_#memory_$Pointer$.base|)) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from false [2022-11-20 11:52:36,599 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) |c_#memory_int|) (exists ((v_ArrVal_5125 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5125) |c_#memory_$Pointer$.offset|)) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_5127 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5127) |c_#memory_int|)) (= .cse1 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((v_ArrVal_5126 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5126) |c_#memory_$Pointer$.base|)) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from true [2022-11-20 11:52:36,612 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) (.cse2 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (= (select .cse0 8) |c_node_create_#in~data#1|) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (exists ((v_ArrVal_5128 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5128) |c_#memory_$Pointer$.base|)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse2)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| .cse0) |c_#memory_int|) (exists ((v_ArrVal_5130 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5130) |c_#memory_int|)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_5129 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5129) |c_#memory_$Pointer$.offset|)) (= .cse2 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from false [2022-11-20 11:52:36,616 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) (.cse2 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (= (select .cse0 8) |c_node_create_#in~data#1|) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (exists ((v_ArrVal_5128 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5128) |c_#memory_$Pointer$.base|)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse2)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| .cse0) |c_#memory_int|) (exists ((v_ArrVal_5130 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5130) |c_#memory_int|)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_5129 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5129) |c_#memory_$Pointer$.offset|)) (= .cse2 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from true [2022-11-20 11:52:36,800 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| .cse4 (select |c_#memory_$Pointer$.offset| .cse4)))) (let ((.cse9 (@diff .cse8 |c_#memory_$Pointer$.offset|))) (let ((.cse1 (store .cse8 .cse9 (select |c_#memory_$Pointer$.offset| .cse9)))) (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff .cse1 |c_#memory_$Pointer$.offset|)) (.cse6 (@diff |c_old(#memory_int)| |c_#memory_int|))) (and (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$.offset| .cse1) (= (select |c_old(#valid)| .cse2) 0)) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5130 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_#res#1.base| v_ArrVal_5130) |c_#memory_int|)) (exists ((v_ArrVal_5129 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_5129))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (or (= (select |c_old(#valid)| .cse4) 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 8) |c_node_create_#in~data#1|) (= |c_#memory_$Pointer$.offset| (store .cse1 .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (= |c_#valid| (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse5 (select |c_#valid| .cse5)))) (= (store |c_old(#memory_int)| .cse6 (select |c_#memory_int| .cse6)) |c_#memory_int|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (or (= |c_old(#memory_int)| |c_#memory_int|) (= .cse6 |c_node_create_#res#1.base|)) (exists ((v_ArrVal_5128 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_5128) |c_#memory_$Pointer$.base|)) (or (= |c_#memory_$Pointer$.offset| .cse8) (= (select |c_old(#valid)| .cse9) 0)))))))) is different from false [2022-11-20 11:52:36,813 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| .cse4 (select |c_#memory_$Pointer$.offset| .cse4)))) (let ((.cse9 (@diff .cse8 |c_#memory_$Pointer$.offset|))) (let ((.cse1 (store .cse8 .cse9 (select |c_#memory_$Pointer$.offset| .cse9)))) (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff .cse1 |c_#memory_$Pointer$.offset|)) (.cse6 (@diff |c_old(#memory_int)| |c_#memory_int|))) (and (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$.offset| .cse1) (= (select |c_old(#valid)| .cse2) 0)) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5130 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_#res#1.base| v_ArrVal_5130) |c_#memory_int|)) (exists ((v_ArrVal_5129 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_5129))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (or (= (select |c_old(#valid)| .cse4) 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 8) |c_node_create_#in~data#1|) (= |c_#memory_$Pointer$.offset| (store .cse1 .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (= |c_#valid| (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse5 (select |c_#valid| .cse5)))) (= (store |c_old(#memory_int)| .cse6 (select |c_#memory_int| .cse6)) |c_#memory_int|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (or (= |c_old(#memory_int)| |c_#memory_int|) (= .cse6 |c_node_create_#res#1.base|)) (exists ((v_ArrVal_5128 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_5128) |c_#memory_$Pointer$.base|)) (or (= |c_#memory_$Pointer$.offset| .cse8) (= (select |c_old(#valid)| .cse9) 0)))))))) is different from true [2022-11-20 11:52:36,902 WARN L837 $PredicateComparison]: unable to prove that (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|)) (.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 (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse1) 4)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (+ 2 .cse4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.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|) 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) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse2 |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_~head#1.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 1) (= (select (store |v_#valid_BEFORE_CALL_28| .cse4 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse5) 0))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse4) 8)) (= .cse5 .cse4) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse4)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (not (= .cse1 .cse6)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse6)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse8 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse9 (select |v_#valid_BEFORE_CALL_31| .cse9))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)))))))) is different from false [2022-11-20 11:52:36,908 WARN L859 $PredicateComparison]: unable to prove that (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|)) (.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 (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse1) 4)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (+ 2 .cse4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.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|) 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) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse2 |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_~head#1.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 1) (= (select (store |v_#valid_BEFORE_CALL_28| .cse4 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse5) 0))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse4) 8)) (= .cse5 .cse4) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse4)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (not (= .cse1 .cse6)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse6)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse8 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse9 (select |v_#valid_BEFORE_CALL_31| .cse9))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)))))))) is different from true [2022-11-20 11:52:36,962 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.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)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse7) 4))) (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) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse5)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (not (= .cse5 .cse6)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse6)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse7) 8)) (= .cse8 .cse7) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse7)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse7 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse9 (select |v_#valid_BEFORE_CALL_28| .cse9)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse8) 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 [2022-11-20 11:52:36,968 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.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)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse7) 4))) (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) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse5)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (not (= .cse5 .cse6)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse6)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse7) 8)) (= .cse8 .cse7) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse7)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse7 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse9 (select |v_#valid_BEFORE_CALL_28| .cse9)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse8) 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 [2022-11-20 11:52:37,036 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 ((.cse0 (+ 2 .cse8)) (.cse6 (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))) (.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.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|)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse9 (select (select |c_#memory_$Pointer$.base| .cse8) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| .cse1) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse5 (select |v_#valid_BEFORE_CALL_31| .cse5))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse6 .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse6)) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (= .cse9 .cse8) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse10 (select |v_#valid_BEFORE_CALL_28| .cse10)))) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse9) 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 [2022-11-20 11:52:37,043 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 ((.cse0 (+ 2 .cse8)) (.cse6 (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))) (.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.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|)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse9 (select (select |c_#memory_$Pointer$.base| .cse8) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| .cse1) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse5 (select |v_#valid_BEFORE_CALL_31| .cse5))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse6 .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse6)) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (= .cse9 .cse8) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse10 (select |v_#valid_BEFORE_CALL_28| .cse10)))) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse9) 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 [2022-11-20 11:52:37,093 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)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.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|)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse7) 4))) (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|)) (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$.base| .cse1) (+ (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse4 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |v_#valid_BEFORE_CALL_31| .cse6))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |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| .cse1)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse1)) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse7) 8)) (= .cse8 .cse7) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse7)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse7 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse9 (select |v_#valid_BEFORE_CALL_28| .cse9)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse8) 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 [2022-11-20 11:52:37,099 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)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.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|)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse7) 4))) (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|)) (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$.base| .cse1) (+ (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse4 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |v_#valid_BEFORE_CALL_31| .cse6))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |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| .cse1)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse1)) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse7) 8)) (= .cse8 .cse7) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse7)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse7 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse9 (select |v_#valid_BEFORE_CALL_28| .cse9)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse8) 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 [2022-11-20 11:52:37,141 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)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse7) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse5)) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| .cse5) (+ (select .cse6 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse7) 8)) (= .cse8 .cse7) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse7)) (not (= .cse5 |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse7 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse9 (select |v_#valid_BEFORE_CALL_28| .cse9)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse8) 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 [2022-11-20 11:52:37,147 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)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse7) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse5)) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| .cse5) (+ (select .cse6 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse7) 8)) (= .cse8 .cse7) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse7)) (not (= .cse5 |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse7 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse9 (select |v_#valid_BEFORE_CALL_28| .cse9)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse8) 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 [2022-11-20 11:52:37,189 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse7 (select (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ |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_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse6 (select |v_#valid_BEFORE_CALL_28| .cse6)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse7) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |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) (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse7 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (<= .cse3 |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 [2022-11-20 11:52:37,195 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse7 (select (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ |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_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse6 (select |v_#valid_BEFORE_CALL_28| .cse6)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse7) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |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) (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse7 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (<= .cse3 |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 [2022-11-20 11:52:37,247 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse7 (select (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse6 (select |v_#valid_BEFORE_CALL_28| .cse6)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse7) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |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) (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse7 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (<= .cse3 |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 [2022-11-20 11:52:37,253 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse7 (select (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse6 (select |v_#valid_BEFORE_CALL_28| .cse6)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse7) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |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) (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse7 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (<= .cse3 |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 [2022-11-20 11:52:37,306 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse0 (+ 2 .cse1)) (.cse8 (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 (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (= |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_main_~data~0#1| 1) (= |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) (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse5 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse6 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= (select (store |v_#valid_BEFORE_CALL_28| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse2) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (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 [2022-11-20 11:52:37,312 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse0 (+ 2 .cse1)) (.cse8 (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 (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (= |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_main_~data~0#1| 1) (= |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) (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse5 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse6 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= (select (store |v_#valid_BEFORE_CALL_28| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse2) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (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 [2022-11-20 11:52:37,351 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.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)) (.cse2 (= .cse9 0)) (.cse7 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) .cse2 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) 8)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse5 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse6 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= (select (store |v_#valid_BEFORE_CALL_28| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse8 (select |v_#valid_BEFORE_CALL_31| .cse8))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (= (select |v_old(#valid)_AFTER_CALL_43| .cse7) 0)))) (<= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse9) (or .cse2 (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-20 11:52:37,357 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.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)) (.cse2 (= .cse9 0)) (.cse7 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) .cse2 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) 8)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse5 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse6 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= (select (store |v_#valid_BEFORE_CALL_28| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse8 (select |v_#valid_BEFORE_CALL_31| .cse8))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (= (select |v_old(#valid)_AFTER_CALL_43| .cse7) 0)))) (<= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse9) (or .cse2 (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-20 11:52:37,417 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 8))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (v_arrayElimCell_147 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2)) (.cse4 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_147) 0) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_old(#valid)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_147) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse5 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |v_#valid_BEFORE_CALL_31| .cse6))) |v_#valid_BEFORE_CALL_31|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from false [2022-11-20 11:52:37,422 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 8))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (v_arrayElimCell_147 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2)) (.cse4 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_147) 0) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_old(#valid)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_147) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse5 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |v_#valid_BEFORE_CALL_31| .cse6))) |v_#valid_BEFORE_CALL_31|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from true [2022-11-20 11:52:37,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:52:37,727 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2022-11-20 11:52:37,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-20 11:52:37,728 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 65 states have (on average 1.6) internal successors, (104), 59 states have internal predecessors, (104), 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 61 [2022-11-20 11:52:37,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:52:37,729 INFO L225 Difference]: With dead ends: 107 [2022-11-20 11:52:37,729 INFO L226 Difference]: Without dead ends: 107 [2022-11-20 11:52:37,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 68 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=316, Invalid=1983, Unknown=135, NotChecked=10676, Total=13110 [2022-11-20 11:52:37,733 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 13 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 2386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1877 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:52:37,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 780 Invalid, 2386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 506 Invalid, 0 Unknown, 1877 Unchecked, 0.5s Time] [2022-11-20 11:52:37,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-20 11:52:37,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-11-20 11:52:37,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 100 states have internal predecessors, (105), 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) [2022-11-20 11:52:37,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2022-11-20 11:52:37,737 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 61 [2022-11-20 11:52:37,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:52:37,738 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2022-11-20 11:52:37,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 65 states have (on average 1.6) internal successors, (104), 59 states have internal predecessors, (104), 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) [2022-11-20 11:52:37,738 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2022-11-20 11:52:37,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-20 11:52:37,739 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:52:37,739 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] [2022-11-20 11:52:37,751 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-20 11:52:37,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:52:37,946 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:52:37,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:52:37,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1799557417, now seen corresponding path program 1 times [2022-11-20 11:52:37,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:52:37,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454612232] [2022-11-20 11:52:37,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:52:37,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:52:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:38,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:52:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:38,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:52:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:38,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:52:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-20 11:52:38,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:52:38,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454612232] [2022-11-20 11:52:38,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454612232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:52:38,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:52:38,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:52:38,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127724014] [2022-11-20 11:52:38,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:52:38,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:52:38,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:52:38,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:52:38,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:52:38,112 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 11:52:38,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:52:38,322 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2022-11-20 11:52:38,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:52:38,322 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2022-11-20 11:52:38,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:52:38,323 INFO L225 Difference]: With dead ends: 125 [2022-11-20 11:52:38,323 INFO L226 Difference]: Without dead ends: 125 [2022-11-20 11:52:38,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:52:38,324 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 51 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:52:38,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 304 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:52:38,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-20 11:52:38,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 106. [2022-11-20 11:52:38,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.2682926829268293) 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) [2022-11-20 11:52:38,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2022-11-20 11:52:38,327 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 64 [2022-11-20 11:52:38,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:52:38,328 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2022-11-20 11:52:38,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 11:52:38,328 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2022-11-20 11:52:38,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-20 11:52:38,329 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:52:38,329 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] [2022-11-20 11:52:38,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-20 11:52:38,329 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:52:38,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:52:38,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1799557418, now seen corresponding path program 1 times [2022-11-20 11:52:38,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:52:38,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394883751] [2022-11-20 11:52:38,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:52:38,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:52:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:38,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:52:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:38,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:52:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:38,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:52:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:38,638 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-20 11:52:38,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:52:38,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394883751] [2022-11-20 11:52:38,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394883751] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:52:38,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:52:38,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:52:38,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360332022] [2022-11-20 11:52:38,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:52:38,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:52:38,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:52:38,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:52:38,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:52:38,640 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 11:52:38,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:52:38,867 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2022-11-20 11:52:38,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:52:38,867 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2022-11-20 11:52:38,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:52:38,868 INFO L225 Difference]: With dead ends: 106 [2022-11-20 11:52:38,868 INFO L226 Difference]: Without dead ends: 106 [2022-11-20 11:52:38,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:52:38,869 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 50 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:52:38,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 312 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:52:38,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-20 11:52:38,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2022-11-20 11:52:38,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 98 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) [2022-11-20 11:52:38,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2022-11-20 11:52:38,873 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 64 [2022-11-20 11:52:38,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:52:38,873 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2022-11-20 11:52:38,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 11:52:38,874 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2022-11-20 11:52:38,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-20 11:52:38,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:52:38,875 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] [2022-11-20 11:52:38,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-20 11:52:38,875 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:52:38,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:52:38,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1497139761, now seen corresponding path program 1 times [2022-11-20 11:52:38,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:52:38,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707103510] [2022-11-20 11:52:38,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:52:38,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:52:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:43,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:52:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:43,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:52:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:43,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:52:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:45,113 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:52:45,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:52:45,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707103510] [2022-11-20 11:52:45,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707103510] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:52:45,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965063108] [2022-11-20 11:52:45,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:52:45,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:52:45,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:52:45,115 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:52:45,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-20 11:52:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:45,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-20 11:52:45,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:52:46,217 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 [2022-11-20 11:52:46,277 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 [2022-11-20 11:52:46,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:46,731 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 [2022-11-20 11:52:47,077 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-20 11:52:47,077 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 [2022-11-20 11:52:47,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:47,260 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-20 11:52:47,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 [2022-11-20 11:52:47,267 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 [2022-11-20 11:52:47,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:47,421 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 25 treesize of output 20 [2022-11-20 11:52:47,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:47,728 INFO L321 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2022-11-20 11:52:47,728 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 80 treesize of output 61 [2022-11-20 11:52:47,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:47,738 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 75 [2022-11-20 11:52:48,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:48,594 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 0 case distinctions, treesize of input 100 treesize of output 71 [2022-11-20 11:52:48,795 INFO L321 Elim1Store]: treesize reduction 53, result has 18.5 percent of original size [2022-11-20 11:52:48,795 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 94 treesize of output 48 [2022-11-20 11:52:48,920 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:52:48,920 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:52:48,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965063108] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:52:48,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:52:48,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [38] total 63 [2022-11-20 11:52:48,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315402398] [2022-11-20 11:52:48,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:52:48,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 11:52:48,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:52:48,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 11:52:48,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=3828, Unknown=1, NotChecked=0, Total=4032 [2022-11-20 11:52:48,923 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand has 28 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 25 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 11:52:51,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:52:51,002 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2022-11-20 11:52:51,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-20 11:52:51,003 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 25 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2022-11-20 11:52:51,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:52:51,004 INFO L225 Difference]: With dead ends: 129 [2022-11-20 11:52:51,004 INFO L226 Difference]: Without dead ends: 129 [2022-11-20 11:52:51,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1498 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=300, Invalid=5399, Unknown=1, NotChecked=0, Total=5700 [2022-11-20 11:52:51,006 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 77 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:52:51,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 814 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 871 Invalid, 0 Unknown, 211 Unchecked, 0.7s Time] [2022-11-20 11:52:51,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-20 11:52:51,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 110. [2022-11-20 11:52:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 87 states have (on average 1.264367816091954) internal successors, (110), 103 states have internal predecessors, (110), 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) [2022-11-20 11:52:51,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2022-11-20 11:52:51,020 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 66 [2022-11-20 11:52:51,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:52:51,021 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2022-11-20 11:52:51,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 25 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 11:52:51,021 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2022-11-20 11:52:51,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-20 11:52:51,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:52:51,022 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] [2022-11-20 11:52:51,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-20 11:52:51,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-20 11:52:51,223 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:52:51,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:52:51,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1497139760, now seen corresponding path program 1 times [2022-11-20 11:52:51,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:52:51,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317310838] [2022-11-20 11:52:51,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:52:51,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:52:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:58,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:52:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:59,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:52:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:59,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:52:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:00,348 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:53:00,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:53:00,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317310838] [2022-11-20 11:53:00,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317310838] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:53:00,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904189501] [2022-11-20 11:53:00,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:53:00,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:53:00,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:53:00,350 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:53:00,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-20 11:53:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:00,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 157 conjunts are in the unsatisfiable core [2022-11-20 11:53:00,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:53:00,923 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 [2022-11-20 11:53:01,457 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 [2022-11-20 11:53:01,462 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 [2022-11-20 11:53:01,911 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:53:01,911 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 [2022-11-20 11:53:01,934 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 [2022-11-20 11:53:02,332 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 [2022-11-20 11:53:02,347 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 [2022-11-20 11:53:02,646 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:53:02,647 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 [2022-11-20 11:53:02,664 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 [2022-11-20 11:53:03,139 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:53:03,139 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 [2022-11-20 11:53:03,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:03,175 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 [2022-11-20 11:53:03,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:03,365 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 [2022-11-20 11:53:03,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:03,376 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 [2022-11-20 11:53:03,985 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:53:03,986 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 100 treesize of output 39 [2022-11-20 11:53:03,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:03,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 11:53:04,001 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 [2022-11-20 11:53:04,006 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 [2022-11-20 11:53:04,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:04,982 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:53:04,982 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 110 treesize of output 80 [2022-11-20 11:53:05,016 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 11:53:05,016 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 [2022-11-20 11:53:05,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:05,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:05,035 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 25 treesize of output 30 [2022-11-20 11:53:05,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 11:53:06,471 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2022-11-20 11:53:06,472 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 142 treesize of output 111 [2022-11-20 11:53:06,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:06,516 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-20 11:53:06,516 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 39 treesize of output 45 [2022-11-20 11:53:06,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:06,568 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:53:06,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 108 treesize of output 78 [2022-11-20 11:53:06,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:06,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:06,591 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 25 treesize of output 30 [2022-11-20 11:53:06,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:06,700 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:53:06,700 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 108 treesize of output 78 [2022-11-20 11:53:06,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:06,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:06,727 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 25 treesize of output 30 [2022-11-20 11:53:07,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:07,139 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:53:07,143 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:53:07,143 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 132 treesize of output 84 [2022-11-20 11:53:07,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:07,166 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-20 11:53:07,166 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 1 case distinctions, treesize of input 69 treesize of output 62 [2022-11-20 11:53:07,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:07,831 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 11:53:07,831 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 1 case distinctions, treesize of input 49 treesize of output 27 [2022-11-20 11:53:08,151 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:53:08,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 26 [2022-11-20 11:53:08,263 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:53:08,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:53:11,878 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6098 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (+ (select (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store .cse7 .cse5 (store (select .cse7 .cse5) .cse6 v_ArrVal_6102)))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6103 Int)) (let ((.cse3 (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 v_ArrVal_6103)))) (let ((.cse1 (select (select .cse3 |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 .cse2)))))))) (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6098 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse11 (+ (select (select .cse13 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse8 (store .cse13 .cse10 (store (select .cse13 .cse10) .cse11 v_ArrVal_6102)))) (let ((.cse12 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6103 Int)) (<= 0 (+ 8 (select (select .cse8 (select (select (store .cse9 .cse10 (store (select .cse9 .cse10) .cse11 v_ArrVal_6103)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse12)))) (not (<= 0 .cse12))))))))) is different from false [2022-11-20 11:53:11,975 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse1 (store .cse5 .cse3 (store (select .cse5 .cse3) .cse4 v_ArrVal_6102)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_6103 Int)) (<= 0 (+ 8 (select (select .cse1 (select (select (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_ArrVal_6103)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0)))))))))) (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse12 (+ (select (select .cse13 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse7 (store .cse13 .cse11 (store (select .cse13 .cse11) .cse12 v_ArrVal_6102)))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse6)) (forall ((v_ArrVal_6103 Int)) (let ((.cse9 (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_ArrVal_6103)))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ 12 (select (select .cse7 .cse8) .cse6)) (select |c_#length| (select (select .cse9 .cse8) .cse6))))))))))))) is different from false [2022-11-20 11:53:12,019 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 v_ArrVal_6102)))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6103 Int)) (<= 0 (+ (select (select .cse0 (select (select (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_6103)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4) 8))) (not (<= 0 .cse4)))))))) (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse12 (+ (select (select .cse13 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse7 (store .cse13 .cse11 (store (select .cse13 .cse11) .cse12 v_ArrVal_6102)))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse6)) (forall ((v_ArrVal_6103 Int)) (let ((.cse9 (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_ArrVal_6103)))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse7 .cse8) .cse6) 12) (select |c_#length| (select (select .cse9 .cse8) .cse6))))))))))))) is different from false [2022-11-20 11:53:12,056 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (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)))) (and (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse4 (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (+ 4 (select (select .cse7 |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_6102)))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6103 Int)) (let ((.cse3 (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 v_ArrVal_6103)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse0 .cse1) .cse2) 12) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (<= 0 .cse2)))))))) (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse11 (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse13 (+ 4 (select (select .cse14 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse10 (store .cse14 .cse12 (store (select .cse14 .cse12) .cse13 v_ArrVal_6102)))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse9)) (forall ((v_ArrVal_6103 Int)) (<= 0 (+ (select (select .cse10 (select (select (store .cse11 .cse12 (store (select .cse11 .cse12) .cse13 v_ArrVal_6103)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse9) 8))))))))))) is different from false [2022-11-20 11:53:12,101 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (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)))) (and (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse1 (store (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 v_ArrVal_6102)))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6103 Int)) (<= 0 (+ (select (select .cse0 (select (select (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_6103)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4) 8))) (not (<= 0 .cse4)))))))) (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse11 (store (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse13 (+ (select (select .cse14 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse7 (store .cse14 .cse12 (store (select .cse14 .cse12) .cse13 v_ArrVal_6102)))) (let ((.cse9 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6103 Int)) (let ((.cse10 (store .cse11 .cse12 (store (select .cse11 .cse12) .cse13 v_ArrVal_6103)))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse7 .cse8) .cse9) 12) (select |c_#length| (select (select .cse10 .cse8) .cse9)))))) (not (<= 0 .cse9)))))))))) is different from false [2022-11-20 11:53:12,253 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (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)))) (and (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6099)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6098))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse1 (store .cse5 .cse3 (store (select .cse5 .cse3) .cse4 v_ArrVal_6102)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_6103 Int)) (<= 0 (+ (select (select .cse1 (select (select (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_ArrVal_6103)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0) 8))))))))) (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6099)) (.cse11 (store (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6098))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse13 (+ (select (select .cse14 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse8 (store .cse14 .cse12 (store (select .cse14 .cse12) .cse13 v_ArrVal_6102)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse7)) (forall ((v_ArrVal_6103 Int)) (let ((.cse10 (store .cse11 .cse12 (store (select .cse11 .cse12) .cse13 v_ArrVal_6103)))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse8 .cse9) .cse7) 12) (select |c_#length| (select (select .cse10 .cse9) .cse7)))))))))))))) is different from false [2022-11-20 11:53:13,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904189501] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:53:13,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:53:13,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 36] total 75 [2022-11-20 11:53:13,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811524218] [2022-11-20 11:53:13,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:53:13,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-11-20 11:53:13,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:53:13,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-11-20 11:53:13,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=6696, Unknown=12, NotChecked=1014, Total=8010 [2022-11-20 11:53:13,564 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand has 76 states, 71 states have (on average 1.676056338028169) internal successors, (119), 67 states have internal predecessors, (119), 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) [2022-11-20 11:53:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:53:24,310 INFO L93 Difference]: Finished difference Result 182 states and 192 transitions. [2022-11-20 11:53:24,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-20 11:53:24,311 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 71 states have (on average 1.676056338028169) internal successors, (119), 67 states have internal predecessors, (119), 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 66 [2022-11-20 11:53:24,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:53:24,312 INFO L225 Difference]: With dead ends: 182 [2022-11-20 11:53:24,312 INFO L226 Difference]: Without dead ends: 182 [2022-11-20 11:53:24,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 117 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2548 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=717, Invalid=11950, Unknown=13, NotChecked=1362, Total=14042 [2022-11-20 11:53:24,314 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 1195 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 2439 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 2782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 277 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:53:24,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 1284 Invalid, 2782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2439 Invalid, 0 Unknown, 277 Unchecked, 2.7s Time] [2022-11-20 11:53:24,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-11-20 11:53:24,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 113. [2022-11-20 11:53:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 106 states have internal predecessors, (114), 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) [2022-11-20 11:53:24,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2022-11-20 11:53:24,318 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 66 [2022-11-20 11:53:24,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:53:24,318 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2022-11-20 11:53:24,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 71 states have (on average 1.676056338028169) internal successors, (119), 67 states have internal predecessors, (119), 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) [2022-11-20 11:53:24,319 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2022-11-20 11:53:24,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-20 11:53:24,319 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:53:24,319 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] [2022-11-20 11:53:24,332 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-20 11:53:24,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:53:24,520 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:53:24,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:53:24,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1497139726, now seen corresponding path program 1 times [2022-11-20 11:53:24,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:53:24,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529340432] [2022-11-20 11:53:24,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:53:24,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:53:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:29,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:53:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:29,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:53:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:29,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:53:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:30,115 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:53:30,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:53:30,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529340432] [2022-11-20 11:53:30,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529340432] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:53:30,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110387560] [2022-11-20 11:53:30,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:53:30,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:53:30,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:53:30,117 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:53:30,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-20 11:53:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:30,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 137 conjunts are in the unsatisfiable core [2022-11-20 11:53:30,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:53:30,656 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 [2022-11-20 11:53:30,731 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 [2022-11-20 11:53:30,975 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:53:30,975 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 [2022-11-20 11:53:31,175 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 [2022-11-20 11:53:31,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:31,432 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:53:31,432 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 [2022-11-20 11:53:31,725 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 [2022-11-20 11:53:31,927 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:53:31,927 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 [2022-11-20 11:53:32,281 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:53:32,281 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 [2022-11-20 11:53:32,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:32,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 43 treesize of output 30 [2022-11-20 11:53:32,812 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:53:32,813 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 [2022-11-20 11:53:32,821 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 [2022-11-20 11:53:32,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:32,829 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 [2022-11-20 11:53:33,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:33,531 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 [2022-11-20 11:53:33,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:33,562 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:53:33,562 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 [2022-11-20 11:53:33,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:33,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:33,603 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 11:53:33,603 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 [2022-11-20 11:53:34,736 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2022-11-20 11:53:34,737 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 136 treesize of output 107 [2022-11-20 11:53:34,768 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:53:34,768 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 [2022-11-20 11:53:35,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:35,013 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:53:35,013 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 102 treesize of output 74 [2022-11-20 11:53:35,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:35,031 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 33 treesize of output 33 [2022-11-20 11:53:35,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:35,133 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:53:35,133 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 102 treesize of output 74 [2022-11-20 11:53:35,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:35,157 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 33 treesize of output 33 [2022-11-20 11:53:35,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:35,565 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:53:35,573 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-20 11:53:35,573 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 68 [2022-11-20 11:53:35,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:35,593 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 [2022-11-20 11:53:36,522 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-11-20 11:53:36,523 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 66 treesize of output 28 [2022-11-20 11:53:36,530 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 [2022-11-20 11:53:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:53:36,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:53:37,188 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6420 (Array Int Int)) (v_ArrVal_6418 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) v_ArrVal_6418)))) (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_6420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) 1)) is different from false [2022-11-20 11:53:38,134 INFO L321 Elim1Store]: treesize reduction 5, result has 96.5 percent of original size [2022-11-20 11:53:38,134 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 147 treesize of output 146 [2022-11-20 11:53:38,146 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6420 (Array Int Int)) (v_ArrVal_6412 (Array Int Int)) (v_ArrVal_6418 Int) (v_ArrVal_6413 (Array Int Int)) (v_ArrVal_6416 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6412) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6416))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6413) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6417)) (.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) v_ArrVal_6418)))) (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_6420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) is different from false [2022-11-20 11:53:38,159 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6420 (Array Int Int)) (v_ArrVal_6412 (Array Int Int)) (v_ArrVal_6418 Int) (v_ArrVal_6413 (Array Int Int)) (v_ArrVal_6416 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6412) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6416))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6413) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6417)) (.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) v_ArrVal_6418)))) (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_6420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base|)) is different from false [2022-11-20 11:53:38,172 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6420 (Array Int Int)) (v_ArrVal_6412 (Array Int Int)) (v_ArrVal_6418 Int) (v_ArrVal_6413 (Array Int Int)) (v_ArrVal_6416 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (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)))) (= .cse0 (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6412) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6416))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6413) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6417)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse1 (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6418)))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store .cse4 .cse3 v_ArrVal_6420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-20 11:53:38,188 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6420 (Array Int Int)) (v_ArrVal_6412 (Array Int Int)) (v_ArrVal_6418 Int) (v_ArrVal_6413 (Array Int Int)) (v_ArrVal_6416 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (let ((.cse4 (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 (store (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_6412) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6416))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_6413) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6417)) (.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) (+ 4 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) v_ArrVal_6418)))) (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_6420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) .cse4))) is different from false [2022-11-20 11:53:38,219 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6420 (Array Int Int)) (v_ArrVal_6412 (Array Int Int)) (v_ArrVal_6418 Int) (v_ArrVal_6413 (Array Int Int)) (v_ArrVal_6416 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (let ((.cse4 (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 (store (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_6412) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6416))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_6413) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6417)) (.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) v_ArrVal_6418)))) (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_6420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) .cse4))) is different from false [2022-11-20 11:53:38,328 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6430 (Array Int Int)) (v_ArrVal_6420 (Array Int Int)) (v_ArrVal_6412 (Array Int Int)) (v_ArrVal_6418 Int) (v_ArrVal_6413 (Array Int Int)) (v_ArrVal_6416 (Array Int Int)) (v_ArrVal_6429 (Array Int Int)) (v_ArrVal_6417 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_34| |c_#StackHeapBarrier|)) (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_34| v_ArrVal_6429)) (.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_34| v_ArrVal_6430))) (let ((.cse5 (select (select .cse6 (select (select .cse6 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (= (let ((.cse1 (store (store .cse6 .cse5 v_ArrVal_6412) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_34| v_ArrVal_6416))) (let ((.cse3 (store (store .cse4 .cse5 v_ArrVal_6413) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_34| v_ArrVal_6417)) (.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) v_ArrVal_6418)))) (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_6420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) .cse5))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_34|) 0)))) is different from false [2022-11-20 11:53:38,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110387560] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:53:38,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:53:38,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 35] total 71 [2022-11-20 11:53:38,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755831445] [2022-11-20 11:53:38,332 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:53:38,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-20 11:53:38,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:53:38,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-20 11:53:38,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=5483, Unknown=110, NotChecked=1092, Total=6972 [2022-11-20 11:53:38,335 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 72 states, 67 states have (on average 1.7313432835820894) internal successors, (116), 63 states have internal predecessors, (116), 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) [2022-11-20 11:53:46,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:53:46,228 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2022-11-20 11:53:46,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-20 11:53:46,229 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 67 states have (on average 1.7313432835820894) internal successors, (116), 63 states have internal predecessors, (116), 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 66 [2022-11-20 11:53:46,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:53:46,230 INFO L225 Difference]: With dead ends: 163 [2022-11-20 11:53:46,230 INFO L226 Difference]: Without dead ends: 163 [2022-11-20 11:53:46,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 108 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2778 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=666, Invalid=9748, Unknown=120, NotChecked=1456, Total=11990 [2022-11-20 11:53:46,233 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 775 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 2428 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 2659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:53:46,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 1461 Invalid, 2659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2428 Invalid, 0 Unknown, 170 Unchecked, 2.5s Time] [2022-11-20 11:53:46,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-20 11:53:46,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 113. [2022-11-20 11:53:46,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 106 states have internal predecessors, (113), 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) [2022-11-20 11:53:46,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2022-11-20 11:53:46,238 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 66 [2022-11-20 11:53:46,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:53:46,239 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2022-11-20 11:53:46,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 67 states have (on average 1.7313432835820894) internal successors, (116), 63 states have internal predecessors, (116), 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) [2022-11-20 11:53:46,239 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2022-11-20 11:53:46,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-20 11:53:46,240 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:53:46,241 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, 1, 1] [2022-11-20 11:53:46,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-20 11:53:46,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:53:46,450 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:53:46,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:53:46,450 INFO L85 PathProgramCache]: Analyzing trace with hash 62737026, now seen corresponding path program 1 times [2022-11-20 11:53:46,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:53:46,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471186266] [2022-11-20 11:53:46,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:53:46,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:53:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:50,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:53:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:51,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:53:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:51,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:53:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:52,914 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:53:52,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:53:52,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471186266] [2022-11-20 11:53:52,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471186266] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:53:52,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805154465] [2022-11-20 11:53:52,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:53:52,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:53:52,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:53:52,923 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:53:52,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-20 11:53:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:53,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 142 conjunts are in the unsatisfiable core [2022-11-20 11:53:53,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:53:53,486 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 [2022-11-20 11:53:53,577 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 [2022-11-20 11:53:53,866 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:53:53,866 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 [2022-11-20 11:53:54,109 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 [2022-11-20 11:53:54,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:54,422 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:53:54,423 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 [2022-11-20 11:53:54,726 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 [2022-11-20 11:53:54,952 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:53:54,952 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 [2022-11-20 11:53:55,328 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:53:55,329 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 [2022-11-20 11:53:55,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:55,376 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 [2022-11-20 11:53:55,946 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:53:55,946 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 [2022-11-20 11:53:55,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:55,956 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 [2022-11-20 11:53:55,962 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 [2022-11-20 11:53:56,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:56,891 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:53:56,891 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 [2022-11-20 11:53:56,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:56,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:56,926 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 11:53:56,926 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 [2022-11-20 11:53:56,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:56,940 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 [2022-11-20 11:53:58,258 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2022-11-20 11:53:58,259 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 117 treesize of output 94 [2022-11-20 11:53:58,295 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:53:58,295 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 31 [2022-11-20 11:53:58,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:58,331 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 [2022-11-20 11:53:58,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:58,353 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:53:58,353 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 83 treesize of output 61 [2022-11-20 11:53:58,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:58,423 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 [2022-11-20 11:53:58,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:58,443 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:53:58,444 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 83 treesize of output 61 [2022-11-20 11:53:58,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:58,746 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:53:58,750 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:53:58,750 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 112 treesize of output 68 [2022-11-20 11:53:58,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:58,765 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 110 treesize of output 104 [2022-11-20 11:53:59,955 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 97 treesize of output 73 [2022-11-20 11:54:00,185 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:54:00,185 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 109 treesize of output 36 [2022-11-20 11:54:00,191 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:54:00,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:54:00,951 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6734 (Array Int Int))) (not (let ((.cse0 (let ((.cse2 (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 .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_6734) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 .cse1) (select .cse0 (+ .cse1 4)))))) is different from false [2022-11-20 11:54:00,962 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6734 (Array Int 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 ((.cse0 (let ((.cse3 (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) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6734) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 .cse1) (select .cse0 (+ .cse1 4))))))) is different from false [2022-11-20 11:54:00,979 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6731 (Array Int Int)) (v_ArrVal_6730 (Array Int Int)) (v_ArrVal_6734 (Array Int Int))) (not (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6730))) (let ((.cse3 (select (select .cse5 |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_6731))) (let ((.cse0 (let ((.cse4 (store .cse5 .cse3 (store (select .cse5 .cse3) (+ 4 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store .cse2 .cse3 v_ArrVal_6734) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 .cse1) (select .cse0 (+ .cse1 4)))))))) is different from false [2022-11-20 11:54:01,008 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6731 (Array Int Int)) (v_ArrVal_6730 (Array Int Int)) (v_ArrVal_6734 (Array Int Int)) (v_ArrVal_6726 (Array Int Int)) (v_ArrVal_6727 (Array Int Int))) (not (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6726) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6730))) (let ((.cse3 (select (select .cse5 |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_6727) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6731))) (let ((.cse0 (let ((.cse4 (store .cse5 .cse3 (store (select .cse5 .cse3) (+ 4 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store .cse2 .cse3 v_ArrVal_6734) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 (+ .cse1 4)) (select .cse0 .cse1))))))) is different from false [2022-11-20 11:54:01,021 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6731 (Array Int Int)) (v_ArrVal_6730 (Array Int Int)) (v_ArrVal_6734 (Array Int Int)) (v_ArrVal_6726 (Array Int Int)) (v_ArrVal_6727 (Array Int Int))) (not (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6726) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6730))) (let ((.cse3 (select (select .cse5 |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_6727) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6731))) (let ((.cse0 (let ((.cse4 (store .cse5 .cse3 (store (select .cse5 .cse3) (+ 4 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store .cse2 .cse3 v_ArrVal_6734) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 .cse1) (select .cse0 (+ .cse1 4)))))))) is different from false [2022-11-20 11:54:01,041 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6731 (Array Int Int)) (v_ArrVal_6730 (Array Int Int)) (v_ArrVal_6734 (Array Int Int)) (v_ArrVal_6726 (Array Int Int)) (v_ArrVal_6727 (Array Int Int))) (not (let ((.cse6 (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 ((.cse5 (store (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_6726) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6730))) (let ((.cse3 (select (select .cse5 |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| .cse6 v_ArrVal_6727) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6731))) (let ((.cse0 (let ((.cse4 (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (select (select .cse2 |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 .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store .cse2 .cse3 v_ArrVal_6734) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 .cse1) (select .cse0 (+ .cse1 4))))))))) is different from false [2022-11-20 11:54:01,076 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6731 (Array Int Int)) (v_ArrVal_6730 (Array Int Int)) (v_ArrVal_6734 (Array Int Int)) (v_ArrVal_6726 (Array Int Int)) (v_ArrVal_6727 (Array Int Int))) (not (let ((.cse6 (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 ((.cse5 (store (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_6726) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6730))) (let ((.cse3 (select (select .cse5 |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| .cse6 v_ArrVal_6727) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6731))) (let ((.cse0 (let ((.cse4 (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (select (select .cse2 |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 .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store .cse2 .cse3 v_ArrVal_6734) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 (+ .cse1 4)) (select .cse0 .cse1)))))))) is different from false [2022-11-20 11:54:01,108 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6731 (Array Int Int)) (v_ArrVal_6730 (Array Int Int)) (v_ArrVal_6734 (Array Int Int)) (v_ArrVal_6726 (Array Int Int)) (v_ArrVal_6727 (Array Int Int))) (not (let ((.cse6 (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 ((.cse5 (store (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_6726) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6730))) (let ((.cse3 (select (select .cse5 |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| .cse6 v_ArrVal_6727) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6731))) (let ((.cse0 (let ((.cse4 (store .cse5 .cse3 (store (select .cse5 .cse3) (+ 4 (select (select .cse2 |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~ret9#1.base|)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store .cse2 .cse3 v_ArrVal_6734) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 (+ .cse1 4)) (select .cse0 .cse1)))))))) is different from false [2022-11-20 11:54:01,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805154465] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:54:01,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:54:01,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 35] total 75 [2022-11-20 11:54:01,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828712133] [2022-11-20 11:54:01,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:54:01,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-11-20 11:54:01,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:54:01,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-11-20 11:54:01,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=6382, Unknown=11, NotChecked=1336, Total=8010 [2022-11-20 11:54:01,617 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand has 75 states, 71 states have (on average 1.676056338028169) internal successors, (119), 66 states have internal predecessors, (119), 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) [2022-11-20 11:54:09,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:54:09,923 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2022-11-20 11:54:09,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-20 11:54:09,923 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 71 states have (on average 1.676056338028169) internal successors, (119), 66 states have internal predecessors, (119), 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 68 [2022-11-20 11:54:09,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:54:09,924 INFO L225 Difference]: With dead ends: 112 [2022-11-20 11:54:09,924 INFO L226 Difference]: Without dead ends: 112 [2022-11-20 11:54:09,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 2536 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=579, Invalid=10783, Unknown=12, NotChecked=1736, Total=13110 [2022-11-20 11:54:09,926 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 125 mSDsluCounter, 1679 mSDsCounter, 0 mSdLazyCounter, 2099 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 2235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:54:09,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1732 Invalid, 2235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2099 Invalid, 0 Unknown, 95 Unchecked, 2.4s Time] [2022-11-20 11:54:09,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-20 11:54:09,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-20 11:54:09,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 89 states have (on average 1.247191011235955) internal successors, (111), 105 states have internal predecessors, (111), 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) [2022-11-20 11:54:09,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2022-11-20 11:54:09,930 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 68 [2022-11-20 11:54:09,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:54:09,931 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2022-11-20 11:54:09,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 71 states have (on average 1.676056338028169) internal successors, (119), 66 states have internal predecessors, (119), 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) [2022-11-20 11:54:09,931 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2022-11-20 11:54:09,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-20 11:54:09,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:54:09,932 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, 1] [2022-11-20 11:54:09,940 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-20 11:54:10,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-20 11:54:10,139 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:54:10,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:54:10,140 INFO L85 PathProgramCache]: Analyzing trace with hash 62769824, now seen corresponding path program 1 times [2022-11-20 11:54:10,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:54:10,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751396604] [2022-11-20 11:54:10,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:54:10,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:54:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:16,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:54:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:16,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:54:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:17,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:54:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:18,700 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:54:18,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:54:18,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751396604] [2022-11-20 11:54:18,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751396604] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:54:18,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615131784] [2022-11-20 11:54:18,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:54:18,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:54:18,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:54:18,702 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:54:18,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-20 11:54:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:19,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 219 conjunts are in the unsatisfiable core [2022-11-20 11:54:19,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:54:19,396 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 [2022-11-20 11:54:19,501 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 [2022-11-20 11:54:19,944 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 [2022-11-20 11:54:19,948 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 [2022-11-20 11:54:20,040 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 [2022-11-20 11:54:20,864 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:54:20,864 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 14 treesize of output 20 [2022-11-20 11:54:20,875 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 [2022-11-20 11:54:20,904 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:54:20,904 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 [2022-11-20 11:54:21,366 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 [2022-11-20 11:54:21,383 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 [2022-11-20 11:54:21,410 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 [2022-11-20 11:54:21,757 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:54:21,758 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 84 treesize of output 73 [2022-11-20 11:54:21,766 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 [2022-11-20 11:54:21,781 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 31 treesize of output 26 [2022-11-20 11:54:22,403 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:54:22,404 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 14 treesize of output 20 [2022-11-20 11:54:22,410 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 [2022-11-20 11:54:22,451 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:54:22,452 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 51 treesize of output 45 [2022-11-20 11:54:22,461 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 23 treesize of output 22 [2022-11-20 11:54:22,682 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 [2022-11-20 11:54:22,704 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 55 treesize of output 38 [2022-11-20 11:54:22,712 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 20 treesize of output 22 [2022-11-20 11:54:23,582 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:54:23,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:54:23,588 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:54:23,589 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 168 treesize of output 65 [2022-11-20 11:54:23,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:54:23,608 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:54:23,608 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 21 [2022-11-20 11:54:23,616 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 [2022-11-20 11:54:23,623 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 [2022-11-20 11:54:23,629 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 [2022-11-20 11:54:24,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:54:24,801 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:54:24,801 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 176 treesize of output 142 [2022-11-20 11:54:24,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:54:24,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:54:24,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:54:24,823 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 163 treesize of output 144 [2022-11-20 11:54:24,853 INFO L321 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2022-11-20 11:54:24,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 1 case distinctions, treesize of input 28 treesize of output 48 [2022-11-20 11:54:24,866 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 [2022-11-20 11:54:24,903 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-11-20 11:54:24,903 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 34 treesize of output 36 [2022-11-20 11:54:24,959 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 16 treesize of output 18 [2022-11-20 11:54:27,310 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2022-11-20 11:54:27,311 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 261 treesize of output 212 [2022-11-20 11:54:27,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:54:27,327 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:54:27,353 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-20 11:54:27,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 229 treesize of output 199 [2022-11-20 11:54:27,368 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:54:27,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:54:27,371 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 75 treesize of output 60 [2022-11-20 11:54:27,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:54:27,687 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:54:27,687 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 174 treesize of output 140 [2022-11-20 11:54:27,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:54:27,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:54:27,706 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 162 treesize of output 143 [2022-11-20 11:54:27,751 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 28 treesize of output 30 [2022-11-20 11:54:27,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:54:27,930 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:54:27,930 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 174 treesize of output 140 [2022-11-20 11:54:27,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:54:27,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:54:27,950 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 162 treesize of output 143 [2022-11-20 11:54:27,960 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 28 treesize of output 30 [2022-11-20 11:54:28,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:54:28,519 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:54:28,523 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:54:28,524 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 228 treesize of output 119 [2022-11-20 11:54:28,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:54:28,552 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-20 11:54:28,552 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 2 case distinctions, treesize of input 199 treesize of output 149 [2022-11-20 11:54:28,567 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 30 treesize of output 32 [2022-11-20 11:54:29,847 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 17 treesize of output 9 [2022-11-20 11:54:31,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:54:31,351 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:54:31,355 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:54:31,356 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 233 treesize of output 92 [2022-11-20 11:54:31,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:54:31,376 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:54:31,377 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 27 [2022-11-20 11:54:31,727 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 [2022-11-20 11:54:31,909 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:54:31,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:54:51,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615131784] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:54:51,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:54:51,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 40] total 77 [2022-11-20 11:54:51,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150022701] [2022-11-20 11:54:51,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:54:51,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-20 11:54:51,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:54:51,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-20 11:54:51,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=8369, Unknown=19, NotChecked=0, Total=8742 [2022-11-20 11:54:51,763 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand has 77 states, 73 states have (on average 1.6164383561643836) internal successors, (118), 69 states have internal predecessors, (118), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 11:55:09,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:55:09,309 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2022-11-20 11:55:09,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-20 11:55:09,310 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 73 states have (on average 1.6164383561643836) internal successors, (118), 69 states have internal predecessors, (118), 6 states have call successors, (6), 3 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 68 [2022-11-20 11:55:09,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:55:09,317 INFO L225 Difference]: With dead ends: 112 [2022-11-20 11:55:09,317 INFO L226 Difference]: Without dead ends: 112 [2022-11-20 11:55:09,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 44 SyntacticMatches, 9 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2696 ImplicationChecksByTransitivity, 44.4s TimeCoverageRelationStatistics Valid=733, Invalid=14008, Unknown=21, NotChecked=0, Total=14762 [2022-11-20 11:55:09,318 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 70 mSDsluCounter, 1874 mSDsCounter, 0 mSdLazyCounter, 2343 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 352 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:55:09,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1926 Invalid, 2733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2343 Invalid, 0 Unknown, 352 Unchecked, 3.5s Time] [2022-11-20 11:55:09,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-20 11:55:09,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-20 11:55:09,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 105 states have internal predecessors, (110), 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) [2022-11-20 11:55:09,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2022-11-20 11:55:09,327 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 68 [2022-11-20 11:55:09,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:55:09,327 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2022-11-20 11:55:09,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 73 states have (on average 1.6164383561643836) internal successors, (118), 69 states have internal predecessors, (118), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 11:55:09,328 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2022-11-20 11:55:09,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-20 11:55:09,329 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:55:09,329 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, 1, 1] [2022-11-20 11:55:09,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-20 11:55:09,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-20 11:55:09,537 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:55:09,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:55:09,538 INFO L85 PathProgramCache]: Analyzing trace with hash 2089489187, now seen corresponding path program 1 times [2022-11-20 11:55:09,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:55:09,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901423233] [2022-11-20 11:55:09,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:55:09,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:55:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:18,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:55:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:19,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:55:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:19,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:55:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:20,583 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:55:20,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:55:20,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901423233] [2022-11-20 11:55:20,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901423233] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:55:20,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398747567] [2022-11-20 11:55:20,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:55:20,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:55:20,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:55:20,586 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:55:20,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b771b4-8212-4f9b-81e1-cb18fb11e7d5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-20 11:55:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:21,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-20 11:55:21,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:55:21,221 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 [2022-11-20 11:55:21,337 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 [2022-11-20 11:55:21,658 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:55:21,658 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 [2022-11-20 11:55:21,927 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 [2022-11-20 11:55:22,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:55:22,189 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 [2022-11-20 11:55:22,876 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 [2022-11-20 11:55:22,995 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 [2022-11-20 11:55:23,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:55:23,801 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 [2022-11-20 11:55:24,321 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-20 11:55:24,321 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 [2022-11-20 11:55:24,328 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 6 treesize of output 5 [2022-11-20 11:55:24,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:55:24,592 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-20 11:55:24,592 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 [2022-11-20 11:55:24,601 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 [2022-11-20 11:55:24,610 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 6 treesize of output 5 [2022-11-20 11:55:24,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:55:24,656 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 [2022-11-20 11:55:24,670 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 6 treesize of output 5 [2022-11-20 11:55:24,915 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-20 11:55:24,915 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 45 treesize of output 35 [2022-11-20 11:55:24,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:55:24,924 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 49 treesize of output 49 [2022-11-20 11:55:25,329 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 46 treesize of output 34 [2022-11-20 11:55:25,574 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-20 11:55:25,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 22 [2022-11-20 11:55:25,704 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 11:55:25,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:55:26,351 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7389 (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_7389) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)) is different from false [2022-11-20 11:55:26,363 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7389 (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_7389) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) 1)) is different from false [2022-11-20 11:55:26,384 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7386 (Array Int Int)) (v_ArrVal_7389 (Array Int Int)) (v_ArrVal_7385 (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_7385))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7386)) (.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_7389) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) 1)) is different from false [2022-11-20 11:55:26,452 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:55:26,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20230 treesize of output 19921 [2022-11-20 11:55:26,489 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 19910 treesize of output 19782 [2022-11-20 11:55:26,554 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:55:26,555 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 19782 treesize of output 19630 [2022-11-20 11:55:26,622 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:55:26,623 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 19622 treesize of output 19310