./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8 --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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- 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-2329fc7 [2022-12-13 11:21:14,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:21:14,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:21:14,505 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:21:14,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:21:14,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:21:14,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:21:14,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:21:14,510 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:21:14,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:21:14,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:21:14,512 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:21:14,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:21:14,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:21:14,515 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:21:14,516 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:21:14,516 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:21:14,517 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:21:14,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:21:14,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:21:14,522 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:21:14,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:21:14,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:21:14,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:21:14,528 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:21:14,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:21:14,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:21:14,529 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:21:14,530 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:21:14,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:21:14,531 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:21:14,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:21:14,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:21:14,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:21:14,534 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:21:14,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:21:14,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:21:14,535 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:21:14,535 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:21:14,536 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:21:14,536 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:21:14,537 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 11:21:14,557 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:21:14,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:21:14,558 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 11:21:14,558 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 11:21:14,559 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 11:21:14,559 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 11:21:14,564 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:21:14,565 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:21:14,565 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:21:14,565 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:21:14,565 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:21:14,565 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 11:21:14,566 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:21:14,566 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:21:14,566 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:21:14,566 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 11:21:14,566 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 11:21:14,566 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 11:21:14,567 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:21:14,567 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 11:21:14,567 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:21:14,567 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:21:14,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:21:14,568 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:21:14,568 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:21:14,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:21:14,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:21:14,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:21:14,569 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:21:14,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:21:14,569 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 11:21:14,569 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 11:21:14,569 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 11:21:14,569 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 11:21:14,570 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/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_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8 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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2022-12-13 11:21:14,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:21:14,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:21:14,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:21:14,805 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:21:14,806 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:21:14,807 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2022-12-13 11:21:17,344 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:21:17,547 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:21:17,547 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2022-12-13 11:21:17,555 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/data/02c859191/81f9994f97ad4fac941fc7b5f7cf5205/FLAG914addb7d [2022-12-13 11:21:17,901 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/data/02c859191/81f9994f97ad4fac941fc7b5f7cf5205 [2022-12-13 11:21:17,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:21:17,904 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 11:21:17,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:21:17,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:21:17,907 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:21:17,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:21:17" (1/1) ... [2022-12-13 11:21:17,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4021d83c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:17, skipping insertion in model container [2022-12-13 11:21:17,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:21:17" (1/1) ... [2022-12-13 11:21:17,914 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:21:17,940 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:21:18,165 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_f61f7ab6-7be4-4afa-9cd3-730236096d27/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2022-12-13 11:21:18,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:21:18,177 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:21:18,215 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_f61f7ab6-7be4-4afa-9cd3-730236096d27/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2022-12-13 11:21:18,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:21:18,247 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:21:18,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:18 WrapperNode [2022-12-13 11:21:18,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:21:18,248 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:21:18,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:21:18,249 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:21:18,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:18" (1/1) ... [2022-12-13 11:21:18,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:18" (1/1) ... [2022-12-13 11:21:18,287 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2022-12-13 11:21:18,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:21:18,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:21:18,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:21:18,288 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:21:18,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:18" (1/1) ... [2022-12-13 11:21:18,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:18" (1/1) ... [2022-12-13 11:21:18,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:18" (1/1) ... [2022-12-13 11:21:18,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:18" (1/1) ... [2022-12-13 11:21:18,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:18" (1/1) ... [2022-12-13 11:21:18,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:18" (1/1) ... [2022-12-13 11:21:18,313 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:18" (1/1) ... [2022-12-13 11:21:18,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:18" (1/1) ... [2022-12-13 11:21:18,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:21:18,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:21:18,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:21:18,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:21:18,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:18" (1/1) ... [2022-12-13 11:21:18,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:21:18,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:21:18,345 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:21:18,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:21:18,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 11:21:18,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:21:18,382 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-12-13 11:21:18,383 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-12-13 11:21:18,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 11:21:18,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:21:18,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:21:18,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 11:21:18,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 11:21:18,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:21:18,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 11:21:18,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:21:18,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:21:18,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:21:18,476 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 11:21:18,478 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:21:18,702 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 11:21:18,707 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:21:18,707 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 11:21:18,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:21:18 BoogieIcfgContainer [2022-12-13 11:21:18,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:21:18,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:21:18,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:21:18,713 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:21:18,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:21:17" (1/3) ... [2022-12-13 11:21:18,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8004236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:21:18, skipping insertion in model container [2022-12-13 11:21:18,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:18" (2/3) ... [2022-12-13 11:21:18,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8004236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:21:18, skipping insertion in model container [2022-12-13 11:21:18,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:21:18" (3/3) ... [2022-12-13 11:21:18,715 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2022-12-13 11:21:18,729 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:21:18,730 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2022-12-13 11:21:18,763 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:21:18,767 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5c92ad2e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 11:21:18,767 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2022-12-13 11:21:18,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 48 states have (on average 1.9375) internal successors, (93), 81 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 11:21:18,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 11:21:18,775 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:21:18,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:21:18,776 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:21:18,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:18,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1813904761, now seen corresponding path program 1 times [2022-12-13 11:21:18,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:18,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092198739] [2022-12-13 11:21:18,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:18,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:21:18,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:18,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092198739] [2022-12-13 11:21:18,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092198739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:21:18,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:21:18,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:21:18,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831166182] [2022-12-13 11:21:18,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:21:18,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:21:18,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:18,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:21:18,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:21:19,000 INFO L87 Difference]: Start difference. First operand has 85 states, 48 states have (on average 1.9375) internal successors, (93), 81 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-12-13 11:21:19,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:21:19,084 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2022-12-13 11:21:19,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:21:19,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2022-12-13 11:21:19,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:21:19,094 INFO L225 Difference]: With dead ends: 83 [2022-12-13 11:21:19,094 INFO L226 Difference]: Without dead ends: 80 [2022-12-13 11:21:19,096 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-12-13 11:21:19,099 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 8 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:21:19,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 130 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:21:19,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-13 11:21:19,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-12-13 11:21:19,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 46 states have (on average 1.7826086956521738) internal successors, (82), 76 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 11:21:19,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2022-12-13 11:21:19,135 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 7 [2022-12-13 11:21:19,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:21:19,135 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2022-12-13 11:21:19,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-12-13 11:21:19,136 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2022-12-13 11:21:19,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 11:21:19,136 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:21:19,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:21:19,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:21:19,136 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:21:19,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:19,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1813904762, now seen corresponding path program 1 times [2022-12-13 11:21:19,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:19,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575584041] [2022-12-13 11:21:19,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:19,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:19,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:21:19,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:19,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575584041] [2022-12-13 11:21:19,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575584041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:21:19,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:21:19,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:21:19,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558716744] [2022-12-13 11:21:19,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:21:19,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:21:19,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:19,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:21:19,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:21:19,245 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-12-13 11:21:19,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:21:19,303 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-12-13 11:21:19,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:21:19,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2022-12-13 11:21:19,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:21:19,304 INFO L225 Difference]: With dead ends: 78 [2022-12-13 11:21:19,304 INFO L226 Difference]: Without dead ends: 78 [2022-12-13 11:21:19,304 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-12-13 11:21:19,305 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:21:19,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 130 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 11:21:19,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-12-13 11:21:19,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-12-13 11:21:19,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 74 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 11:21:19,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2022-12-13 11:21:19,310 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 7 [2022-12-13 11:21:19,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:21:19,311 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2022-12-13 11:21:19,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-12-13 11:21:19,311 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2022-12-13 11:21:19,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 11:21:19,312 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:21:19,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:21:19,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:21:19,312 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:21:19,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:19,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1961810752, now seen corresponding path program 1 times [2022-12-13 11:21:19,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:19,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99232972] [2022-12-13 11:21:19,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:19,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:19,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:21:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:19,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:21:19,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:19,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99232972] [2022-12-13 11:21:19,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99232972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:21:19,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:21:19,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:21:19,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337451737] [2022-12-13 11:21:19,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:21:19,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:21:19,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:19,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:21:19,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:21:19,440 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-12-13 11:21:19,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:21:19,591 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2022-12-13 11:21:19,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:21:19,592 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2022-12-13 11:21:19,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:21:19,593 INFO L225 Difference]: With dead ends: 82 [2022-12-13 11:21:19,593 INFO L226 Difference]: Without dead ends: 82 [2022-12-13 11:21:19,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-12-13 11:21:19,594 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 11 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:21:19,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 300 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:21:19,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-12-13 11:21:19,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2022-12-13 11:21:19,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 11:21:19,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2022-12-13 11:21:19,600 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 13 [2022-12-13 11:21:19,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:21:19,600 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2022-12-13 11:21:19,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-12-13 11:21:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2022-12-13 11:21:19,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 11:21:19,601 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:21:19,601 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:21:19,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:21:19,601 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:21:19,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:19,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1961810753, now seen corresponding path program 1 times [2022-12-13 11:21:19,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:19,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656728470] [2022-12-13 11:21:19,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:19,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:19,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:21:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:19,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:21:19,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:19,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656728470] [2022-12-13 11:21:19,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656728470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:21:19,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:21:19,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:21:19,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814721547] [2022-12-13 11:21:19,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:21:19,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:21:19,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:19,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:21:19,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:21:19,827 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-12-13 11:21:20,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:21:20,013 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2022-12-13 11:21:20,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:21:20,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2022-12-13 11:21:20,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:21:20,014 INFO L225 Difference]: With dead ends: 81 [2022-12-13 11:21:20,014 INFO L226 Difference]: Without dead ends: 81 [2022-12-13 11:21:20,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-12-13 11:21:20,016 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 9 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:21:20,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 316 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 11:21:20,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-12-13 11:21:20,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2022-12-13 11:21:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 72 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 11:21:20,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2022-12-13 11:21:20,021 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 13 [2022-12-13 11:21:20,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:21:20,021 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2022-12-13 11:21:20,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-12-13 11:21:20,022 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-12-13 11:21:20,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 11:21:20,022 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:21:20,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:21:20,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:21:20,023 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:21:20,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:20,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1399608384, now seen corresponding path program 1 times [2022-12-13 11:21:20,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:20,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537158701] [2022-12-13 11:21:20,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:20,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:20,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 11:21:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:20,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:21:20,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:20,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537158701] [2022-12-13 11:21:20,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537158701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:21:20,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:21:20,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:21:20,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316285802] [2022-12-13 11:21:20,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:21:20,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:21:20,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:20,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:21:20,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:21:20,075 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-12-13 11:21:20,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:21:20,134 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2022-12-13 11:21:20,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:21:20,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2022-12-13 11:21:20,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:21:20,135 INFO L225 Difference]: With dead ends: 82 [2022-12-13 11:21:20,135 INFO L226 Difference]: Without dead ends: 82 [2022-12-13 11:21:20,135 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-12-13 11:21:20,136 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 4 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:21:20,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 192 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:21:20,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-12-13 11:21:20,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2022-12-13 11:21:20,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 11:21:20,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2022-12-13 11:21:20,140 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 15 [2022-12-13 11:21:20,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:21:20,141 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2022-12-13 11:21:20,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-12-13 11:21:20,141 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2022-12-13 11:21:20,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 11:21:20,141 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:21:20,141 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:21:20,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:21:20,142 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:21:20,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:20,142 INFO L85 PathProgramCache]: Analyzing trace with hash -898428094, now seen corresponding path program 1 times [2022-12-13 11:21:20,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:20,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566734705] [2022-12-13 11:21:20,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:20,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:20,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:21:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:20,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 11:21:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:20,234 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 11:21:20,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:20,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566734705] [2022-12-13 11:21:20,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566734705] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:21:20,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113213618] [2022-12-13 11:21:20,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:20,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:21:20,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:21:20,236 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:21:20,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 11:21:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:20,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 11:21:20,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:21:20,369 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:21:20,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:21:20,401 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 11:21:20,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113213618] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:21:20,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:21:20,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-12-13 11:21:20,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992281864] [2022-12-13 11:21:20,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:21:20,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:21:20,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:20,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:21:20,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:21:20,403 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 11:21:20,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:21:20,471 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2022-12-13 11:21:20,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:21:20,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-12-13 11:21:20,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:21:20,472 INFO L225 Difference]: With dead ends: 83 [2022-12-13 11:21:20,472 INFO L226 Difference]: Without dead ends: 83 [2022-12-13 11:21:20,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:21:20,473 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 4 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:21:20,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 267 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:21:20,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-12-13 11:21:20,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-12-13 11:21:20,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 78 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 11:21:20,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2022-12-13 11:21:20,477 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 28 [2022-12-13 11:21:20,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:21:20,477 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2022-12-13 11:21:20,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 11:21:20,477 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2022-12-13 11:21:20,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 11:21:20,478 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:21:20,478 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:21:20,489 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 11:21:20,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 11:21:20,679 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:21:20,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:20,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1437186176, now seen corresponding path program 2 times [2022-12-13 11:21:20,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:20,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774586830] [2022-12-13 11:21:20,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:20,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:20,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:21:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:21,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:21:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:21,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:21:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:21,159 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-13 11:21:21,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:21,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774586830] [2022-12-13 11:21:21,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774586830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:21:21,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:21:21,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:21:21,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690444208] [2022-12-13 11:21:21,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:21:21,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:21:21,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:21,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:21:21,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:21:21,161 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 11:21:21,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:21:21,287 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2022-12-13 11:21:21,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:21:21,288 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-12-13 11:21:21,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:21:21,288 INFO L225 Difference]: With dead ends: 90 [2022-12-13 11:21:21,288 INFO L226 Difference]: Without dead ends: 90 [2022-12-13 11:21:21,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:21:21,289 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 110 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:21:21,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 173 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:21:21,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-12-13 11:21:21,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2022-12-13 11:21:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 73 states have internal predecessors, (79), 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-12-13 11:21:21,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2022-12-13 11:21:21,293 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 41 [2022-12-13 11:21:21,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:21:21,293 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2022-12-13 11:21:21,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 11:21:21,294 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2022-12-13 11:21:21,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 11:21:21,294 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:21:21,294 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:21:21,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:21:21,294 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:21:21,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:21,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1437186175, now seen corresponding path program 1 times [2022-12-13 11:21:21,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:21,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042446833] [2022-12-13 11:21:21,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:21,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:21,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:21:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:21,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:21:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:21,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:21:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:21,893 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 11:21:21,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:21,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042446833] [2022-12-13 11:21:21,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042446833] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:21:21,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188630282] [2022-12-13 11:21:21,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:21,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:21:21,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:21:21,895 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:21:21,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 11:21:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:22,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 11:21:22,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:21:22,060 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-12-13 11:21:22,092 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-12-13 11:21:22,119 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_452 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_452))))) is different from true [2022-12-13 11:21:22,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:21:22,178 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-12-13 11:21:22,217 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-12-13 11:21:22,227 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_453 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_453) |c_#length|)))) is different from true [2022-12-13 11:21:22,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:21:22,275 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-12-13 11:21:22,341 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-12-13 11:21:22,350 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_454 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_454) |c_#length|)))) is different from true [2022-12-13 11:21:22,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:21:22,391 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-12-13 11:21:22,413 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 18 not checked. [2022-12-13 11:21:22,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:21:22,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188630282] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:21:22,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:21:22,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2022-12-13 11:21:22,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787605380] [2022-12-13 11:21:22,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:21:22,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 11:21:22,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:22,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 11:21:22,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=220, Unknown=3, NotChecked=96, Total=380 [2022-12-13 11:21:22,517 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 18 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 11:21:22,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:21:22,777 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2022-12-13 11:21:22,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 11:21:22,778 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2022-12-13 11:21:22,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:21:22,779 INFO L225 Difference]: With dead ends: 85 [2022-12-13 11:21:22,779 INFO L226 Difference]: Without dead ends: 85 [2022-12-13 11:21:22,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=268, Unknown=3, NotChecked=108, Total=462 [2022-12-13 11:21:22,780 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 313 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 198 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:21:22,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 186 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 244 Invalid, 0 Unknown, 198 Unchecked, 0.2s Time] [2022-12-13 11:21:22,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-12-13 11:21:22,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2022-12-13 11:21:22,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 68 states have internal predecessors, (74), 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-12-13 11:21:22,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-12-13 11:21:22,785 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 41 [2022-12-13 11:21:22,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:21:22,786 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-12-13 11:21:22,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 11:21:22,786 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-12-13 11:21:22,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 11:21:22,787 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:21:22,787 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:21:22,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 11:21:22,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:21:22,989 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:21:22,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:22,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2129253767, now seen corresponding path program 1 times [2022-12-13 11:21:22,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:22,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055348794] [2022-12-13 11:21:22,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:22,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:23,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:21:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:23,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:21:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:23,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:21:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:24,033 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 11:21:24,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:24,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055348794] [2022-12-13 11:21:24,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055348794] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:21:24,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544186071] [2022-12-13 11:21:24,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:24,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:21:24,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:21:24,035 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:21:24,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 11:21:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:24,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-13 11:21:24,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:21:24,477 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-12-13 11:21:24,481 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-12-13 11:21:24,608 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_616 (Array Int Int)) (v_ArrVal_615 (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_615)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_616)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-12-13 11:21:24,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:21:24,655 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-12-13 11:21:24,664 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 11:21:24,665 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-12-13 11:21:24,669 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-12-13 11:21:24,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:21:24,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 11:21:24,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-12-13 11:21:24,730 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-12-13 11:21:24,783 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-12-13 11:21:24,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:21:25,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544186071] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:21:25,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:21:25,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2022-12-13 11:21:25,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458132601] [2022-12-13 11:21:25,053 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:21:25,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 11:21:25,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:25,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 11:21:25,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1084, Unknown=1, NotChecked=66, Total=1260 [2022-12-13 11:21:25,055 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 32 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 11:21:26,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:21:26,261 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2022-12-13 11:21:26,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 11:21:26,261 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 45 [2022-12-13 11:21:26,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:21:26,262 INFO L225 Difference]: With dead ends: 112 [2022-12-13 11:21:26,262 INFO L226 Difference]: Without dead ends: 112 [2022-12-13 11:21:26,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=241, Invalid=2018, Unknown=1, NotChecked=92, Total=2352 [2022-12-13 11:21:26,264 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 343 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 11:21:26,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 924 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 996 Invalid, 0 Unknown, 104 Unchecked, 0.6s Time] [2022-12-13 11:21:26,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-12-13 11:21:26,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 77. [2022-12-13 11:21:26,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 72 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 11:21:26,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2022-12-13 11:21:26,269 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 45 [2022-12-13 11:21:26,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:21:26,269 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2022-12-13 11:21:26,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 11:21:26,269 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2022-12-13 11:21:26,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 11:21:26,270 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:21:26,270 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:21:26,275 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 11:21:26,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:21:26,471 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:21:26,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:26,471 INFO L85 PathProgramCache]: Analyzing trace with hash 2129253766, now seen corresponding path program 1 times [2022-12-13 11:21:26,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:26,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071159074] [2022-12-13 11:21:26,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:26,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:26,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:21:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:26,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:21:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:26,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:21:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:26,948 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 11:21:26,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:26,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071159074] [2022-12-13 11:21:26,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071159074] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:21:26,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855475512] [2022-12-13 11:21:26,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:26,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:21:26,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:21:26,949 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:21:26,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 11:21:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:27,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-13 11:21:27,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:21:27,246 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-12-13 11:21:27,345 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_784 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_784) |c_#memory_$Pointer$.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-12-13 11:21:27,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:21:27,369 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-12-13 11:21:27,379 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-13 11:21:27,380 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-12-13 11:21:27,446 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-12-13 11:21:27,459 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 11:21:27,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:21:27,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855475512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:21:27,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 11:21:27,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2022-12-13 11:21:27,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789018526] [2022-12-13 11:21:27,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:21:27,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 11:21:27,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:27,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 11:21:27,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=575, Unknown=2, NotChecked=48, Total=702 [2022-12-13 11:21:27,461 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 11:21:27,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:21:27,795 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2022-12-13 11:21:27,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 11:21:27,796 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-12-13 11:21:27,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:21:27,796 INFO L225 Difference]: With dead ends: 104 [2022-12-13 11:21:27,796 INFO L226 Difference]: Without dead ends: 104 [2022-12-13 11:21:27,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=811, Unknown=2, NotChecked=58, Total=992 [2022-12-13 11:21:27,797 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 60 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:21:27,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 518 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 415 Invalid, 3 Unknown, 120 Unchecked, 0.2s Time] [2022-12-13 11:21:27,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-12-13 11:21:27,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 75. [2022-12-13 11:21:27,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 56 states have (on average 1.375) internal successors, (77), 70 states have internal predecessors, (77), 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-12-13 11:21:27,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2022-12-13 11:21:27,801 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 45 [2022-12-13 11:21:27,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:21:27,802 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2022-12-13 11:21:27,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 11:21:27,802 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2022-12-13 11:21:27,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 11:21:27,803 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:21:27,803 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:21:27,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 11:21:28,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 11:21:28,005 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:21:28,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:28,006 INFO L85 PathProgramCache]: Analyzing trace with hash -35949242, now seen corresponding path program 1 times [2022-12-13 11:21:28,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:28,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656964317] [2022-12-13 11:21:28,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:28,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:28,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:21:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:28,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:21:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:28,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:21:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:28,226 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 11:21:28,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:28,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656964317] [2022-12-13 11:21:28,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656964317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:21:28,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:21:28,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 11:21:28,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164000118] [2022-12-13 11:21:28,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:21:28,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 11:21:28,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:28,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 11:21:28,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:21:28,228 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 11:21:28,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:21:28,412 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2022-12-13 11:21:28,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 11:21:28,412 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-12-13 11:21:28,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:21:28,413 INFO L225 Difference]: With dead ends: 136 [2022-12-13 11:21:28,413 INFO L226 Difference]: Without dead ends: 136 [2022-12-13 11:21:28,413 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-12-13 11:21:28,414 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 164 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:21:28,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 310 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:21:28,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-12-13 11:21:28,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 79. [2022-12-13 11:21:28,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 61 states have (on average 1.360655737704918) internal successors, (83), 74 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 11:21:28,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2022-12-13 11:21:28,417 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 48 [2022-12-13 11:21:28,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:21:28,417 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2022-12-13 11:21:28,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 11:21:28,418 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2022-12-13 11:21:28,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 11:21:28,418 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:21:28,418 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:21:28,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:21:28,418 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:21:28,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:28,419 INFO L85 PathProgramCache]: Analyzing trace with hash -35949241, now seen corresponding path program 1 times [2022-12-13 11:21:28,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:28,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92662989] [2022-12-13 11:21:28,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:28,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:28,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:21:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:28,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:21:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:28,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:21:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 11:21:28,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:28,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92662989] [2022-12-13 11:21:28,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92662989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:21:28,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:21:28,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 11:21:28,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645990127] [2022-12-13 11:21:28,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:21:28,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 11:21:28,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:28,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 11:21:28,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:21:28,715 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 11:21:28,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:21:28,937 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2022-12-13 11:21:28,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 11:21:28,937 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-12-13 11:21:28,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:21:28,939 INFO L225 Difference]: With dead ends: 126 [2022-12-13 11:21:28,939 INFO L226 Difference]: Without dead ends: 126 [2022-12-13 11:21:28,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-12-13 11:21:28,939 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 150 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:21:28,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 323 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 11:21:28,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-12-13 11:21:28,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 81. [2022-12-13 11:21:28,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 76 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 11:21:28,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2022-12-13 11:21:28,942 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 48 [2022-12-13 11:21:28,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:21:28,942 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2022-12-13 11:21:28,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 11:21:28,943 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2022-12-13 11:21:28,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-13 11:21:28,943 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:21:28,943 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:21:28,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 11:21:28,944 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:21:28,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:28,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1114427801, now seen corresponding path program 1 times [2022-12-13 11:21:28,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:28,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511073430] [2022-12-13 11:21:28,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:28,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:29,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:21:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:29,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:21:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:29,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:21:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:29,136 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 11:21:29,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:29,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511073430] [2022-12-13 11:21:29,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511073430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:21:29,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:21:29,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 11:21:29,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004112695] [2022-12-13 11:21:29,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:21:29,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 11:21:29,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:29,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 11:21:29,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:21:29,138 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 11:21:29,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:21:29,293 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2022-12-13 11:21:29,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 11:21:29,293 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2022-12-13 11:21:29,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:21:29,294 INFO L225 Difference]: With dead ends: 109 [2022-12-13 11:21:29,294 INFO L226 Difference]: Without dead ends: 109 [2022-12-13 11:21:29,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-12-13 11:21:29,294 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 152 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:21:29,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 508 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:21:29,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-12-13 11:21:29,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 81. [2022-12-13 11:21:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 76 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 11:21:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2022-12-13 11:21:29,297 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 49 [2022-12-13 11:21:29,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:21:29,297 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2022-12-13 11:21:29,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 11:21:29,298 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2022-12-13 11:21:29,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-13 11:21:29,299 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:21:29,299 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:21:29,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 11:21:29,300 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:21:29,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:29,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1553828739, now seen corresponding path program 1 times [2022-12-13 11:21:29,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:29,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895710968] [2022-12-13 11:21:29,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:29,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:30,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:21:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:30,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:21:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:30,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:21:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:30,835 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 11:21:30,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:30,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895710968] [2022-12-13 11:21:30,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895710968] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:21:30,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38017312] [2022-12-13 11:21:30,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:30,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:21:30,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:21:30,837 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:21:30,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 11:21:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:30,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 104 conjunts are in the unsatisfiable core [2022-12-13 11:21:30,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:21:31,259 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 11:21:31,259 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-12-13 11:21:31,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 11:21:31,364 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-12-13 11:21:31,368 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-12-13 11:21:31,634 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:21:31,634 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 75 treesize of output 38 [2022-12-13 11:21:31,640 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:21:31,640 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 1 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 11:21:31,789 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1257 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1257))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1261 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1261) |c_#memory_$Pointer$.offset|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1260 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1260) |c_#memory_$Pointer$.base|)))) is different from true [2022-12-13 11:21:31,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:21:31,826 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 11:21:31,826 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 81 treesize of output 69 [2022-12-13 11:21:31,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:21:31,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:21:31,837 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 11:21:31,837 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 50 treesize of output 49 [2022-12-13 11:21:31,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:21:31,843 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 30 treesize of output 32 [2022-12-13 11:21:31,853 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 11:21:31,854 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-12-13 11:21:32,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:21:32,102 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:21:32,103 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:21:32,104 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 87 treesize of output 47 [2022-12-13 11:21:32,110 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-12-13 11:21:32,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 27 [2022-12-13 11:21:32,186 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-13 11:21:32,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:21:32,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38017312] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:21:32,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:21:32,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22] total 48 [2022-12-13 11:21:32,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478831248] [2022-12-13 11:21:32,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:21:32,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-13 11:21:32,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:32,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-13 11:21:32,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2496, Unknown=2, NotChecked=100, Total=2756 [2022-12-13 11:21:32,547 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 49 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 43 states have internal predecessors, (85), 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-12-13 11:21:37,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:21:37,970 INFO L93 Difference]: Finished difference Result 183 states and 200 transitions. [2022-12-13 11:21:37,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-13 11:21:37,970 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 43 states have internal predecessors, (85), 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 49 [2022-12-13 11:21:37,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:21:37,972 INFO L225 Difference]: With dead ends: 183 [2022-12-13 11:21:37,972 INFO L226 Difference]: Without dead ends: 183 [2022-12-13 11:21:37,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=698, Invalid=5466, Unknown=2, NotChecked=154, Total=6320 [2022-12-13 11:21:37,975 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 1320 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 1997 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 2208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-13 11:21:37,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1320 Valid, 1347 Invalid, 2208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1997 Invalid, 0 Unknown, 162 Unchecked, 1.6s Time] [2022-12-13 11:21:37,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-12-13 11:21:37,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 80. [2022-12-13 11:21:37,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.296875) internal successors, (83), 75 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 11:21:37,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2022-12-13 11:21:37,979 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 49 [2022-12-13 11:21:37,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:21:37,979 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2022-12-13 11:21:37,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 43 states have internal predecessors, (85), 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-12-13 11:21:37,980 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-12-13 11:21:37,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-13 11:21:37,981 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:21:37,981 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:21:37,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 11:21:38,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 11:21:38,182 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:21:38,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:38,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1553828740, now seen corresponding path program 1 times [2022-12-13 11:21:38,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:38,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142897303] [2022-12-13 11:21:38,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:38,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:38,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:21:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:38,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:21:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:38,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:21:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:39,421 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 11:21:39,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:39,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142897303] [2022-12-13 11:21:39,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142897303] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:21:39,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812062449] [2022-12-13 11:21:39,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:39,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:21:39,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:21:39,423 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:21:39,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 11:21:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:39,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 91 conjunts are in the unsatisfiable core [2022-12-13 11:21:39,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:21:39,774 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-12-13 11:21:39,774 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 19 treesize of output 16 [2022-12-13 11:21:39,874 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-12-13 11:21:40,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:21:40,154 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:21:40,154 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 51 treesize of output 18 [2022-12-13 11:21:40,159 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-12-13 11:21:40,315 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1433 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1433))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1434 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1434))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-12-13 11:21:40,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:21:40,360 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 11:21:40,360 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 57 treesize of output 55 [2022-12-13 11:21:40,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:21:40,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 62 treesize of output 58 [2022-12-13 11:21:40,393 INFO L321 Elim1Store]: treesize reduction 90, result has 37.9 percent of original size [2022-12-13 11:21:40,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 69 [2022-12-13 11:21:40,561 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 81 treesize of output 57 [2022-12-13 11:21:40,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:21:40,798 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:21:40,799 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 78 treesize of output 29 [2022-12-13 11:21:40,919 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-13 11:21:40,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:21:41,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812062449] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:21:41,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:21:41,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 45 [2022-12-13 11:21:41,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265571633] [2022-12-13 11:21:41,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:21:41,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-12-13 11:21:41,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:41,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-12-13 11:21:41,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2177, Unknown=2, NotChecked=94, Total=2450 [2022-12-13 11:21:41,180 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 46 states, 43 states have (on average 1.930232558139535) internal successors, (83), 40 states have internal predecessors, (83), 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-12-13 11:21:44,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:21:44,025 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2022-12-13 11:21:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 11:21:44,025 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 1.930232558139535) internal successors, (83), 40 states have internal predecessors, (83), 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 49 [2022-12-13 11:21:44,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:21:44,026 INFO L225 Difference]: With dead ends: 122 [2022-12-13 11:21:44,026 INFO L226 Difference]: Without dead ends: 122 [2022-12-13 11:21:44,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=528, Invalid=4164, Unknown=4, NotChecked=134, Total=4830 [2022-12-13 11:21:44,027 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 599 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 27 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:21:44,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 1353 Invalid, 1700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1561 Invalid, 3 Unknown, 109 Unchecked, 1.1s Time] [2022-12-13 11:21:44,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-12-13 11:21:44,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 80. [2022-12-13 11:21:44,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.28125) internal successors, (82), 75 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 11:21:44,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2022-12-13 11:21:44,029 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 49 [2022-12-13 11:21:44,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:21:44,030 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2022-12-13 11:21:44,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 1.930232558139535) internal successors, (83), 40 states have internal predecessors, (83), 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-12-13 11:21:44,030 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2022-12-13 11:21:44,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-13 11:21:44,030 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:21:44,030 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 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] [2022-12-13 11:21:44,036 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 11:21:44,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 11:21:44,232 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:21:44,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:44,234 INFO L85 PathProgramCache]: Analyzing trace with hash 218878957, now seen corresponding path program 1 times [2022-12-13 11:21:44,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:44,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307948341] [2022-12-13 11:21:44,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:44,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:44,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:21:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:44,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:21:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:44,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:21:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:44,557 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 11:21:44,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:44,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307948341] [2022-12-13 11:21:44,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307948341] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:21:44,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022152888] [2022-12-13 11:21:44,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:44,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:21:44,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:21:44,559 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:21:44,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 11:21:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:44,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-13 11:21:44,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:21:44,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 11:21:44,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 11:21:44,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 11:21:44,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:21:44,993 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-12-13 11:21:45,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 11:21:45,039 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-12-13 11:21:45,106 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-12-13 11:21:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 11:21:45,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:21:45,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022152888] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:21:45,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 11:21:45,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 27 [2022-12-13 11:21:45,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108830337] [2022-12-13 11:21:45,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:21:45,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 11:21:45,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:45,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 11:21:45,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-12-13 11:21:45,128 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 11:21:45,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:21:45,503 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2022-12-13 11:21:45,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 11:21:45,503 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2022-12-13 11:21:45,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:21:45,503 INFO L225 Difference]: With dead ends: 106 [2022-12-13 11:21:45,504 INFO L226 Difference]: Without dead ends: 106 [2022-12-13 11:21:45,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2022-12-13 11:21:45,504 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 138 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:21:45,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 530 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 11:21:45,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-12-13 11:21:45,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 81. [2022-12-13 11:21:45,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 76 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 11:21:45,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2022-12-13 11:21:45,508 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 52 [2022-12-13 11:21:45,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:21:45,508 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2022-12-13 11:21:45,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 11:21:45,508 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2022-12-13 11:21:45,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-13 11:21:45,509 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:21:45,509 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 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] [2022-12-13 11:21:45,514 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 11:21:45,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 11:21:45,710 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:21:45,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:45,712 INFO L85 PathProgramCache]: Analyzing trace with hash -521057353, now seen corresponding path program 1 times [2022-12-13 11:21:45,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:45,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063652001] [2022-12-13 11:21:45,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:45,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:45,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:21:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:45,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:21:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:46,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:21:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:46,144 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 11:21:46,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:46,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063652001] [2022-12-13 11:21:46,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063652001] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:21:46,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647424373] [2022-12-13 11:21:46,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:46,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:21:46,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:21:46,145 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:21:46,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 11:21:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:46,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-13 11:21:46,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:21: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-12-13 11:21:46,300 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-12-13 11:21:46,312 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1784 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_1784))) is different from true [2022-12-13 11:21:46,318 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1784 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_1784))) is different from true [2022-12-13 11:21:46,331 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 11:21:46,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-12-13 11:21:46,394 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-12-13 11:21:46,425 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:21:46,425 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-12-13 11:21:46,578 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 10 [2022-12-13 11:21:46,675 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1787 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1787))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1785 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1785))))) is different from true [2022-12-13 11:21:46,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:21:46,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-13 11:21:46,717 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-12-13 11:21:46,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-12-13 11:21:46,858 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:21:46,858 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 28 treesize of output 29 [2022-12-13 11:21:46,894 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-12-13 11:21:46,898 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 15 not checked. [2022-12-13 11:21:46,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:21:46,907 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1788) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-12-13 11:21:46,980 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) v_ArrVal_1788) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-12-13 11:21:47,024 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1795 Int) (|v_node_create_~temp~0#1.base_31| Int)) (or (not (= 0 (select |c_#valid| |v_node_create_~temp~0#1.base_31|))) (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_31| v_ArrVal_1795) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_31| v_ArrVal_1794))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) v_ArrVal_1788)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1) (not (< |v_node_create_~temp~0#1.base_31| |c_#StackHeapBarrier|)))) is different from false [2022-12-13 11:21:47,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647424373] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:21:47,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:21:47,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 42 [2022-12-13 11:21:47,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581951823] [2022-12-13 11:21:47,026 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:21:47,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-13 11:21:47,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:47,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-13 11:21:47,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1491, Unknown=21, NotChecked=498, Total=2162 [2022-12-13 11:21:47,028 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 43 states, 40 states have (on average 2.15) internal successors, (86), 37 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 11:21:48,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:21:48,104 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2022-12-13 11:21:48,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 11:21:48,105 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 2.15) internal successors, (86), 37 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 52 [2022-12-13 11:21:48,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:21:48,106 INFO L225 Difference]: With dead ends: 156 [2022-12-13 11:21:48,106 INFO L226 Difference]: Without dead ends: 156 [2022-12-13 11:21:48,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=458, Invalid=2851, Unknown=21, NotChecked=702, Total=4032 [2022-12-13 11:21:48,108 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 949 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 24 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 341 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 11:21:48,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 686 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1032 Invalid, 3 Unknown, 341 Unchecked, 0.5s Time] [2022-12-13 11:21:48,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-12-13 11:21:48,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 87. [2022-12-13 11:21:48,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 82 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 11:21:48,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2022-12-13 11:21:48,110 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 52 [2022-12-13 11:21:48,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:21:48,110 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2022-12-13 11:21:48,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 2.15) internal successors, (86), 37 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 11:21:48,110 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2022-12-13 11:21:48,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-13 11:21:48,111 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:21:48,111 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 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] [2022-12-13 11:21:48,116 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 11:21:48,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:21:48,313 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:21:48,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:48,314 INFO L85 PathProgramCache]: Analyzing trace with hash -521057352, now seen corresponding path program 1 times [2022-12-13 11:21:48,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:48,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571481927] [2022-12-13 11:21:48,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:48,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:48,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:21:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:48,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:21:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:48,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:21:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:48,987 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 11:21:48,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:48,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571481927] [2022-12-13 11:21:48,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571481927] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:21:48,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117152611] [2022-12-13 11:21:48,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:48,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:21:48,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:21:48,988 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:21:48,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 11:21:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:49,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-13 11:21:49,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:21:49,387 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 16 treesize of output 8 [2022-12-13 11:21:49,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 11:21:49,461 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1965 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_1964 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1965)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1964)))) is different from true [2022-12-13 11:21:49,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:21:49,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-13 11:21:49,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:21:49,489 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-12-13 11:21:49,722 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 11:21:49,722 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 73 treesize of output 62 [2022-12-13 11:21:49,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:21:49,731 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 36 treesize of output 27 [2022-12-13 11:21:49,736 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 7 treesize of output 3 [2022-12-13 11:21:49,795 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 40 treesize of output 24 [2022-12-13 11:21:49,798 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-12-13 11:21:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-12-13 11:21:49,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:21:49,978 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (and (forall ((v_ArrVal_1966 Int)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store .cse0 .cse1 v_ArrVal_1966)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_1966 Int) (v_ArrVal_1968 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store .cse0 .cse1 v_ArrVal_1966)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-12-13 11:21:50,085 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:21:50,085 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 57 treesize of output 61 [2022-12-13 11:21:52,088 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_node_create_~temp~0#1.base_34| Int)) (or (not (< |v_node_create_~temp~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_34| v_ArrVal_1975))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (forall ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_17| Int)) (or (not (= (select (select .cse0 .cse1) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| 4)) 0)) (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_34| v_ArrVal_1976) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)))) (forall ((v_ArrVal_1968 (Array Int Int))) (= .cse1 (select (select (store .cse0 .cse1 v_ArrVal_1968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (forall ((|v_node_create_~temp~0#1.base_34| Int)) (or (not (< |v_node_create_~temp~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((v_prenex_6 Int) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_17| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_34| v_ArrVal_1975))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_34| v_ArrVal_1976)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse4 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| 4))) (or (not (= (select (select .cse2 .cse3) .cse4) 0)) (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| (select (select .cse5 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (<= 0 (+ (select (select (store .cse5 .cse3 (store (select .cse5 .cse3) .cse4 v_prenex_6)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))))) (forall ((|v_node_create_~temp~0#1.base_34| Int)) (or (forall ((v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_17| Int) (v_ArrVal_1966 Int)) (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_34| v_ArrVal_1975))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_34| v_ArrVal_1976)) (.cse7 (select (select .cse6 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse8 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| 4))) (or (not (= (select (select .cse6 .cse7) .cse8) 0)) (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| (select (select .cse9 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (< (select (select (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 v_ArrVal_1966)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| 1)))))) (not (< |v_node_create_~temp~0#1.base_34| |c_#StackHeapBarrier|))))) is different from false [2022-12-13 11:21:52,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117152611] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:21:52,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:21:52,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 37 [2022-12-13 11:21:52,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276400077] [2022-12-13 11:21:52,092 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:21:52,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-13 11:21:52,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:52,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-13 11:21:52,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1747, Unknown=4, NotChecked=258, Total=2162 [2022-12-13 11:21:52,094 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand has 38 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 34 states have internal predecessors, (76), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 11:21:53,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:21:53,448 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2022-12-13 11:21:53,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 11:21:53,448 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 34 states have internal predecessors, (76), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2022-12-13 11:21:53,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:21:53,448 INFO L225 Difference]: With dead ends: 117 [2022-12-13 11:21:53,448 INFO L226 Difference]: Without dead ends: 117 [2022-12-13 11:21:53,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=452, Invalid=3216, Unknown=4, NotChecked=360, Total=4032 [2022-12-13 11:21:53,449 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 577 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:21:53,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 811 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 793 Invalid, 0 Unknown, 104 Unchecked, 0.4s Time] [2022-12-13 11:21:53,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-12-13 11:21:53,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 89. [2022-12-13 11:21:53,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 84 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 11:21:53,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2022-12-13 11:21:53,452 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 52 [2022-12-13 11:21:53,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:21:53,452 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2022-12-13 11:21:53,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 34 states have internal predecessors, (76), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 11:21:53,452 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-12-13 11:21:53,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-13 11:21:53,452 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:21:53,452 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-12-13 11:21:53,457 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 11:21:53,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 11:21:53,654 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:21:53,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:53,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1804686442, now seen corresponding path program 1 times [2022-12-13 11:21:53,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:53,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593080751] [2022-12-13 11:21:53,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:53,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:53,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:21:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:53,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:21:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:53,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:21:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:53,938 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 11:21:53,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:53,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593080751] [2022-12-13 11:21:53,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593080751] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:21:53,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750513433] [2022-12-13 11:21:53,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:53,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:21:53,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:21:53,940 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:21:53,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 11:21:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:54,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-13 11:21:54,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:21:54,297 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-12-13 11:21:54,346 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2144 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2144)))) is different from true [2022-12-13 11:21:54,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:21:54,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-13 11:21:54,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 11:21:54,393 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 3 not checked. [2022-12-13 11:21:54,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:21:54,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750513433] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:21:54,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:21:54,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2022-12-13 11:21:54,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076976223] [2022-12-13 11:21:54,464 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:21:54,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 11:21:54,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:54,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 11:21:54,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=4, NotChecked=50, Total=756 [2022-12-13 11:21:54,465 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 26 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 22 states have internal predecessors, (67), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 11:21:54,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:21:54,829 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2022-12-13 11:21:54,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 11:21:54,830 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 22 states have internal predecessors, (67), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 53 [2022-12-13 11:21:54,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:21:54,830 INFO L225 Difference]: With dead ends: 80 [2022-12-13 11:21:54,830 INFO L226 Difference]: Without dead ends: 80 [2022-12-13 11:21:54,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=4, NotChecked=66, Total=1260 [2022-12-13 11:21:54,831 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 310 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:21:54,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 551 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 449 Invalid, 0 Unknown, 68 Unchecked, 0.2s Time] [2022-12-13 11:21:54,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-13 11:21:54,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-12-13 11:21:54,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.265625) internal successors, (81), 75 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 11:21:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2022-12-13 11:21:54,833 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 53 [2022-12-13 11:21:54,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:21:54,833 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2022-12-13 11:21:54,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 22 states have internal predecessors, (67), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 11:21:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2022-12-13 11:21:54,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-13 11:21:54,833 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:21:54,833 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:21:54,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 11:21:55,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:21:55,034 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:21:55,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:55,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1947817869, now seen corresponding path program 2 times [2022-12-13 11:21:55,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:55,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945781679] [2022-12-13 11:21:55,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:55,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:56,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:21:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:56,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:21:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:56,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:21:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:56,878 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 11:21:56,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:56,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945781679] [2022-12-13 11:21:56,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945781679] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:21:56,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925373964] [2022-12-13 11:21:56,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 11:21:56,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:21:56,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:21:56,880 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:21:56,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 11:21:57,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 11:21:57,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:21:57,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 131 conjunts are in the unsatisfiable core [2022-12-13 11:21:57,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:21:57,094 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-12-13 11:21:57,227 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-12-13 11:21:57,232 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-12-13 11:21:57,643 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 11:21:57,644 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 16 treesize of output 22 [2022-12-13 11:21:57,648 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 7 treesize of output 3 [2022-12-13 11:21:57,659 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-12-13 11:21:57,659 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 19 treesize of output 16 [2022-12-13 11:21:57,666 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-12-13 11:21:57,778 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 23 treesize of output 22 [2022-12-13 11:21:57,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-12-13 11:21:58,155 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-12-13 11:21:58,155 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 84 [2022-12-13 11:21:58,166 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 11:21:58,166 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 29 [2022-12-13 11:21:58,171 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-12-13 11:21:58,256 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2319 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_2320 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2319)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2320)))) is different from true [2022-12-13 11:21:58,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:21:58,292 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-12-13 11:21:58,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 165 treesize of output 149 [2022-12-13 11:21:58,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:21:58,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:21:58,305 INFO L321 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-12-13 11:21:58,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 156 treesize of output 135 [2022-12-13 11:21:58,328 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-12-13 11:21:58,328 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-12-13 11:21:58,849 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-12-13 11:21:58,850 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 205 treesize of output 96 [2022-12-13 11:21:58,858 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 11:21:58,858 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 32 [2022-12-13 11:21:58,898 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-12-13 11:21:58,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:21:59,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925373964] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:21:59,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:21:59,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28] total 52 [2022-12-13 11:21:59,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322833546] [2022-12-13 11:21:59,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:21:59,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-12-13 11:21:59,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:59,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-12-13 11:21:59,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=3027, Unknown=2, NotChecked=110, Total=3306 [2022-12-13 11:21:59,389 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 52 states, 50 states have (on average 1.68) internal successors, (84), 46 states have internal predecessors, (84), 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-12-13 11:22:04,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:22:04,551 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2022-12-13 11:22:04,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 11:22:04,551 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 1.68) internal successors, (84), 46 states have internal predecessors, (84), 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 53 [2022-12-13 11:22:04,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:22:04,552 INFO L225 Difference]: With dead ends: 105 [2022-12-13 11:22:04,552 INFO L226 Difference]: Without dead ends: 105 [2022-12-13 11:22:04,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1346 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=428, Invalid=5274, Unknown=2, NotChecked=148, Total=5852 [2022-12-13 11:22:04,553 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 153 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:22:04,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1201 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1359 Invalid, 0 Unknown, 95 Unchecked, 1.3s Time] [2022-12-13 11:22:04,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-12-13 11:22:04,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2022-12-13 11:22:04,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 93 states have internal predecessors, (101), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 11:22:04,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2022-12-13 11:22:04,557 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 53 [2022-12-13 11:22:04,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:22:04,557 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2022-12-13 11:22:04,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 1.68) internal successors, (84), 46 states have internal predecessors, (84), 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-12-13 11:22:04,557 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2022-12-13 11:22:04,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 11:22:04,558 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:22:04,558 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 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] [2022-12-13 11:22:04,563 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 11:22:04,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:22:04,759 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:22:04,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:22:04,760 INFO L85 PathProgramCache]: Analyzing trace with hash 729745886, now seen corresponding path program 1 times [2022-12-13 11:22:04,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:22:04,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888399416] [2022-12-13 11:22:04,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:22:04,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:22:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:05,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:22:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:05,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:22:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:05,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:22:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:05,978 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 11:22:05,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:22:05,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888399416] [2022-12-13 11:22:05,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888399416] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:22:05,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125499109] [2022-12-13 11:22:05,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:22:05,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:22:05,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:22:05,979 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:22:05,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 11:22:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:06,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 105 conjunts are in the unsatisfiable core [2022-12-13 11:22:06,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:22:06,113 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-12-13 11:22:06,146 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-12-13 11:22:06,168 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_2496 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_2496)))) is different from true [2022-12-13 11:22:06,177 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2496 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_2496))) (not (= |c_node_create_#res#1.base| 0))) is different from true [2022-12-13 11:22:06,188 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 11:22:06,188 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-12-13 11:22:06,313 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 11:22:06,314 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 1 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 11:22:06,319 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-12-13 11:22:06,390 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 11:22:06,390 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 3 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 11:22:06,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-12-13 11:22:06,735 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:22:06,736 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 55 treesize of output 26 [2022-12-13 11:22:06,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-13 11:22:06,746 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-12-13 11:22:06,902 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2500 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_2500) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2504 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2504))) (exists ((v_ArrVal_2503 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2503) |c_#memory_$Pointer$.offset|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-12-13 11:22:06,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:22:06,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 11:22:06,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:22:06,945 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 11:22:06,945 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 61 treesize of output 55 [2022-12-13 11:22:06,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:22:06,950 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-12-13 11:22:06,957 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 11:22:06,957 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 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-13 11:22:07,063 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-12-13 11:22:07,224 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 15 not checked. [2022-12-13 11:22:07,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:22:07,821 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2505 (Array Int Int)) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2514 (Array Int Int)) (|v_node_create_~temp~0#1.base_43| Int) (v_ArrVal_2516 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_43| v_ArrVal_2515))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_43|) 0)) (< (select (store |c_#length| |v_node_create_~temp~0#1.base_43| v_ArrVal_2516) (select (select (store .cse0 .cse1 v_ArrVal_2505) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 8) (not (< |v_node_create_~temp~0#1.base_43| |c_#StackHeapBarrier|)) (not (= (select (select .cse0 .cse1) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_43| v_ArrVal_2514) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4)) 0)))))) is different from false [2022-12-13 11:22:07,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125499109] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:22:07,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:22:07,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 47 [2022-12-13 11:22:07,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400009447] [2022-12-13 11:22:07,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:22:07,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-12-13 11:22:07,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:22:07,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-12-13 11:22:07,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2622, Unknown=15, NotChecked=420, Total=3192 [2022-12-13 11:22:07,825 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand has 47 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 41 states have internal predecessors, (97), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 11:22:11,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:22:11,288 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2022-12-13 11:22:11,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 11:22:11,289 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 41 states have internal predecessors, (97), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 56 [2022-12-13 11:22:11,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:22:11,289 INFO L225 Difference]: With dead ends: 104 [2022-12-13 11:22:11,289 INFO L226 Difference]: Without dead ends: 104 [2022-12-13 11:22:11,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=462, Invalid=4939, Unknown=17, NotChecked=588, Total=6006 [2022-12-13 11:22:11,290 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 334 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 26 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 274 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:22:11,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 923 Invalid, 1971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1668 Invalid, 3 Unknown, 274 Unchecked, 1.1s Time] [2022-12-13 11:22:11,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-12-13 11:22:11,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2022-12-13 11:22:11,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 85 states have internal predecessors, (91), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 11:22:11,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2022-12-13 11:22:11,293 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 56 [2022-12-13 11:22:11,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:22:11,293 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2022-12-13 11:22:11,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 41 states have internal predecessors, (97), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 11:22:11,293 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-12-13 11:22:11,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 11:22:11,293 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:22:11,293 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-12-13 11:22:11,299 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 11:22:11,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-13 11:22:11,495 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:22:11,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:22:11,496 INFO L85 PathProgramCache]: Analyzing trace with hash 294390785, now seen corresponding path program 1 times [2022-12-13 11:22:11,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:22:11,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006052311] [2022-12-13 11:22:11,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:22:11,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:22:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:11,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:22:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:11,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:22:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:12,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:22:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:12,133 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 11:22:12,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:22:12,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006052311] [2022-12-13 11:22:12,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006052311] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:22:12,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410575550] [2022-12-13 11:22:12,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:22:12,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:22:12,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:22:12,134 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:22:12,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 11:22:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:12,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 87 conjunts are in the unsatisfiable core [2022-12-13 11:22:12,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:22:12,409 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-12-13 11:22:12,518 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-12-13 11:22:12,689 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:22:12,689 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 21 treesize of output 12 [2022-12-13 11:22:12,692 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-12-13 11:22:12,807 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2686 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2686))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2690 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2690) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2689 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2689))))) is different from true [2022-12-13 11:22:12,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:22:12,835 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 11:22:12,835 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 29 treesize of output 35 [2022-12-13 11:22:12,854 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-12-13 11:22:12,854 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-12-13 11:22:12,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:22:12,858 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-12-13 11:22:12,922 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-12-13 11:22:13,090 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-12-13 11:22:13,090 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 44 [2022-12-13 11:22:13,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-12-13 11:22:13,136 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:22:13,137 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 40 treesize of output 23 [2022-12-13 11:22:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-12-13 11:22:13,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:22:13,147 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2691 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2691) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-12-13 11:22:13,152 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2691 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_2691) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-12-13 11:22:13,155 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2691 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) v_ArrVal_2691) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-12-13 11:22:13,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410575550] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:22:13,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:22:13,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 50 [2022-12-13 11:22:13,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731323278] [2022-12-13 11:22:13,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:22:13,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-12-13 11:22:13,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:22:13,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-12-13 11:22:13,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2534, Unknown=41, NotChecked=420, Total=3192 [2022-12-13 11:22:13,443 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 51 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 46 states have internal predecessors, (95), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 11:22:16,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:22:16,054 INFO L93 Difference]: Finished difference Result 176 states and 194 transitions. [2022-12-13 11:22:16,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-13 11:22:16,055 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 46 states have internal predecessors, (95), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 56 [2022-12-13 11:22:16,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:22:16,056 INFO L225 Difference]: With dead ends: 176 [2022-12-13 11:22:16,056 INFO L226 Difference]: Without dead ends: 176 [2022-12-13 11:22:16,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1472 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=889, Invalid=6055, Unknown=44, NotChecked=668, Total=7656 [2022-12-13 11:22:16,057 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 1284 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 35 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 11:22:16,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 841 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1493 Invalid, 3 Unknown, 106 Unchecked, 0.7s Time] [2022-12-13 11:22:16,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-12-13 11:22:16,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 94. [2022-12-13 11:22:16,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.25) internal successors, (95), 87 states have internal predecessors, (95), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 11:22:16,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2022-12-13 11:22:16,059 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 56 [2022-12-13 11:22:16,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:22:16,059 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2022-12-13 11:22:16,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 46 states have internal predecessors, (95), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 11:22:16,060 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2022-12-13 11:22:16,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 11:22:16,060 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:22:16,060 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-12-13 11:22:16,065 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 11:22:16,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-13 11:22:16,261 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:22:16,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:22:16,262 INFO L85 PathProgramCache]: Analyzing trace with hash 294390786, now seen corresponding path program 1 times [2022-12-13 11:22:16,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:22:16,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943159349] [2022-12-13 11:22:16,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:22:16,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:22:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:17,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:22:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:17,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:22:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:17,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:22:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:17,850 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 11:22:17,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:22:17,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943159349] [2022-12-13 11:22:17,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943159349] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:22:17,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398076621] [2022-12-13 11:22:17,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:22:17,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:22:17,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:22:17,851 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:22:17,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 11:22:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:17,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 105 conjunts are in the unsatisfiable core [2022-12-13 11:22:17,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:22:17,996 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-12-13 11:22:18,028 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-12-13 11:22:18,100 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:22:18,100 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-12-13 11:22:18,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:22:18,542 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:22:18,542 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 30 treesize of output 17 [2022-12-13 11:22:18,546 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-12-13 11:22:18,690 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2874 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2874))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2875 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2875) |c_#memory_$Pointer$.offset|)))) is different from true [2022-12-13 11:22:18,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:22:18,722 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 11:22:18,723 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 36 treesize of output 40 [2022-12-13 11:22:18,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:22:18,730 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-12-13 11:22:18,739 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 11:22:18,739 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 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-13 11:22:19,229 INFO L321 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2022-12-13 11:22:19,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 120 treesize of output 105 [2022-12-13 11:22:19,242 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-12-13 11:22:19,242 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 1 case distinctions, treesize of input 97 treesize of output 75 [2022-12-13 11:22:19,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:22:19,258 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 11:22:19,258 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 23 [2022-12-13 11:22:19,341 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:22:19,341 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 52 treesize of output 31 [2022-12-13 11:22:19,344 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-12-13 11:22:19,445 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-13 11:22:19,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:22:20,347 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:22:20,348 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 121 treesize of output 125 [2022-12-13 11:22:21,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398076621] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:22:21,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:22:21,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 60 [2022-12-13 11:22:21,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37528180] [2022-12-13 11:22:21,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:22:21,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-12-13 11:22:21,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:22:21,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-12-13 11:22:21,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=4828, Unknown=29, NotChecked=140, Total=5256 [2022-12-13 11:22:21,367 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand has 61 states, 58 states have (on average 1.706896551724138) internal successors, (99), 54 states have internal predecessors, (99), 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-12-13 11:22:25,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:22:25,277 INFO L93 Difference]: Finished difference Result 162 states and 177 transitions. [2022-12-13 11:22:25,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 11:22:25,277 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 58 states have (on average 1.706896551724138) internal successors, (99), 54 states have internal predecessors, (99), 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 56 [2022-12-13 11:22:25,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:22:25,278 INFO L225 Difference]: With dead ends: 162 [2022-12-13 11:22:25,278 INFO L226 Difference]: Without dead ends: 162 [2022-12-13 11:22:25,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2608 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=977, Invalid=9709, Unknown=30, NotChecked=204, Total=10920 [2022-12-13 11:22:25,279 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1262 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 11:22:25,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 747 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1674 Invalid, 0 Unknown, 119 Unchecked, 0.9s Time] [2022-12-13 11:22:25,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-12-13 11:22:25,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 96. [2022-12-13 11:22:25,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 78 states have (on average 1.2179487179487178) internal successors, (95), 89 states have internal predecessors, (95), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 11:22:25,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2022-12-13 11:22:25,282 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 56 [2022-12-13 11:22:25,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:22:25,282 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2022-12-13 11:22:25,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 58 states have (on average 1.706896551724138) internal successors, (99), 54 states have internal predecessors, (99), 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-12-13 11:22:25,282 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2022-12-13 11:22:25,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-13 11:22:25,283 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:22:25,283 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-12-13 11:22:25,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 11:22:25,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:22:25,484 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:22:25,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:22:25,485 INFO L85 PathProgramCache]: Analyzing trace with hash 348951848, now seen corresponding path program 1 times [2022-12-13 11:22:25,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:22:25,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520097181] [2022-12-13 11:22:25,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:22:25,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:22:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:26,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:22:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:27,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:22:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:27,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:22:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:27,780 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 11:22:27,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:22:27,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520097181] [2022-12-13 11:22:27,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520097181] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:22:27,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18980023] [2022-12-13 11:22:27,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:22:27,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:22:27,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:22:27,781 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:22:27,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 11:22:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:27,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 128 conjunts are in the unsatisfiable core [2022-12-13 11:22:27,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:22:28,243 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-12-13 11:22:28,349 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-12-13 11:22:28,496 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 11:22:28,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 11:22:28,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:22:28,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:22:28,675 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 21 treesize of output 20 [2022-12-13 11:22:29,117 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:22:29,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 32 [2022-12-13 11:22:29,120 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-12-13 11:22:29,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-12-13 11:22:29,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-12-13 11:22:29,318 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_3065 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3065))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3064 (Array Int Int))) (= (store |c_old(#memory_int)| |node_create_~temp~0#1.base| v_ArrVal_3064) |c_#memory_int|)) (exists ((v_ArrVal_3063 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3063) |c_#memory_$Pointer$.base|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-12-13 11:22:29,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:22:29,352 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 11:22:29,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 65 [2022-12-13 11:22:29,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:22:29,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 11:22:29,375 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 11:22:29,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-12-13 11:22:29,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:22:29,381 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-12-13 11:22:30,040 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-12-13 11:22:30,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 153 treesize of output 112 [2022-12-13 11:22:30,057 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-12-13 11:22:30,057 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 69 treesize of output 49 [2022-12-13 11:22:30,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:22:30,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-12-13 11:22:30,150 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:22:30,150 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 56 treesize of output 27 [2022-12-13 11:22:30,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 11:22:30,287 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 15 treesize of output 7 [2022-12-13 11:22:30,340 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-13 11:22:30,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:22:30,509 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3066 (Array Int Int)) (v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3067 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_3066) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_3068) |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_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4) v_ArrVal_3067)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-12-13 11:22:31,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18980023] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:22:31,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:22:31,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2022-12-13 11:22:31,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980107591] [2022-12-13 11:22:31,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:22:31,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-12-13 11:22:31,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:22:31,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-12-13 11:22:31,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=5295, Unknown=3, NotChecked=294, Total=5852 [2022-12-13 11:22:31,397 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 66 states, 64 states have (on average 1.65625) internal successors, (106), 58 states have internal predecessors, (106), 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-12-13 11:22:39,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:22:39,080 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2022-12-13 11:22:39,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-13 11:22:39,080 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 64 states have (on average 1.65625) internal successors, (106), 58 states have internal predecessors, (106), 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 60 [2022-12-13 11:22:39,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:22:39,080 INFO L225 Difference]: With dead ends: 157 [2022-12-13 11:22:39,080 INFO L226 Difference]: Without dead ends: 157 [2022-12-13 11:22:39,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2613 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=1115, Invalid=10662, Unknown=3, NotChecked=430, Total=12210 [2022-12-13 11:22:39,082 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1256 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 2052 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 2185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:22:39,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 1063 Invalid, 2185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2052 Invalid, 0 Unknown, 80 Unchecked, 1.2s Time] [2022-12-13 11:22:39,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-12-13 11:22:39,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 106. [2022-12-13 11:22:39,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 88 states have (on average 1.2045454545454546) internal successors, (106), 99 states have internal predecessors, (106), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 11:22:39,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2022-12-13 11:22:39,084 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 60 [2022-12-13 11:22:39,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:22:39,084 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2022-12-13 11:22:39,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 64 states have (on average 1.65625) internal successors, (106), 58 states have internal predecessors, (106), 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-12-13 11:22:39,084 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2022-12-13 11:22:39,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-13 11:22:39,085 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:22:39,085 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2022-12-13 11:22:39,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 11:22:39,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:22:39,286 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:22:39,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:22:39,287 INFO L85 PathProgramCache]: Analyzing trace with hash -2067394117, now seen corresponding path program 1 times [2022-12-13 11:22:39,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:22:39,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908724473] [2022-12-13 11:22:39,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:22:39,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:22:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:40,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:22:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:40,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:22:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:40,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:22:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:41,526 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 11:22:41,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:22:41,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908724473] [2022-12-13 11:22:41,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908724473] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:22:41,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049615203] [2022-12-13 11:22:41,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:22:41,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:22:41,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:22:41,528 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:22:41,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 11:22:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:41,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 115 conjunts are in the unsatisfiable core [2022-12-13 11:22:41,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:22:41,682 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-12-13 11:22:41,685 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-12-13 11:22:41,745 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-12-13 11:22:41,747 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-12-13 11:22:41,932 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 11:22:41,932 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-12-13 11:22:41,944 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:22:41,944 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 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 11:22:42,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-13 11:22:42,390 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 11:22:42,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 11:22:42,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:22:42,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 11:22:42,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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-12-13 11:22:43,018 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:22:43,018 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 78 treesize of output 33 [2022-12-13 11:22:43,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2022-12-13 11:22:43,028 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-12-13 11:22:43,036 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-12-13 11:22:43,251 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_3255 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_3255) |c_#length|)) (exists ((v_ArrVal_3260 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3260))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_3259 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3259) |c_#memory_$Pointer$.offset|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-12-13 11:22:43,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:22:43,291 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 11:22:43,291 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 86 treesize of output 68 [2022-12-13 11:22:43,317 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2022-12-13 11:22:43,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2022-12-13 11:22:43,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:22:43,325 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-12-13 11:22:43,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:22:43,329 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 12 treesize of output 14 [2022-12-13 11:22:43,740 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:22:43,740 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 13 treesize of output 17 [2022-12-13 11:22:44,057 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-12-13 11:22:44,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 78 [2022-12-13 11:22:44,082 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-12-13 11:22:44,226 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-12-13 11:22:44,485 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:22:44,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:22:44,488 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:22:44,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 49 [2022-12-13 11:22:44,901 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2022-12-13 11:22:44,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:22:45,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049615203] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:22:45,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:22:45,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 31] total 67 [2022-12-13 11:22:45,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699752515] [2022-12-13 11:22:45,920 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:22:45,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-12-13 11:22:45,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:22:45,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-12-13 11:22:45,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=5006, Unknown=2, NotChecked=142, Total=5402 [2022-12-13 11:22:45,921 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 68 states, 65 states have (on average 1.676923076923077) internal successors, (109), 60 states have internal predecessors, (109), 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-12-13 11:23:00,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:23:00,713 INFO L93 Difference]: Finished difference Result 170 states and 182 transitions. [2022-12-13 11:23:00,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-13 11:23:00,713 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 65 states have (on average 1.676923076923077) internal successors, (109), 60 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 61 [2022-12-13 11:23:00,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:23:00,714 INFO L225 Difference]: With dead ends: 170 [2022-12-13 11:23:00,714 INFO L226 Difference]: Without dead ends: 170 [2022-12-13 11:23:00,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2899 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=1480, Invalid=11402, Unknown=4, NotChecked=224, Total=13110 [2022-12-13 11:23:00,715 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1629 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 2096 mSolverCounterSat, 58 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1629 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 2288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2096 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:23:00,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1629 Valid, 868 Invalid, 2288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2096 Invalid, 3 Unknown, 131 Unchecked, 2.1s Time] [2022-12-13 11:23:00,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-12-13 11:23:00,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 109. [2022-12-13 11:23:00,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 102 states have internal predecessors, (111), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 11:23:00,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2022-12-13 11:23:00,717 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 61 [2022-12-13 11:23:00,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:23:00,718 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2022-12-13 11:23:00,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 65 states have (on average 1.676923076923077) internal successors, (109), 60 states have internal predecessors, (109), 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-12-13 11:23:00,718 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2022-12-13 11:23:00,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-13 11:23:00,718 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:23:00,718 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2022-12-13 11:23:00,723 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-13 11:23:00,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 11:23:00,920 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:23:00,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:23:00,921 INFO L85 PathProgramCache]: Analyzing trace with hash -2067394116, now seen corresponding path program 1 times [2022-12-13 11:23:00,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:23:00,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62015363] [2022-12-13 11:23:00,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:23:00,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:23:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:02,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:23:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:02,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:23:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:02,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:23:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:02,874 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 11:23:02,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:23:02,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62015363] [2022-12-13 11:23:02,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62015363] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:23:02,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755855060] [2022-12-13 11:23:02,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:23:02,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:23:02,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:23:02,876 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:23:02,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 11:23:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:03,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 133 conjunts are in the unsatisfiable core [2022-12-13 11:23:03,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:23:03,059 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-12-13 11:23:03,063 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-12-13 11:23:03,105 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-12-13 11:23:03,107 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-12-13 11:23:03,294 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 11:23:03,294 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-12-13 11:23:03,311 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 11:23:03,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 11:23:03,584 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:23:03,585 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 1 case distinctions, treesize of input 16 treesize of output 14 [2022-12-13 11:23:03,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-12-13 11:23:03,756 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-12-13 11:23:03,757 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 5 case distinctions, treesize of input 22 treesize of output 33 [2022-12-13 11:23:03,769 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 11:23:03,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 24 treesize of output 27 [2022-12-13 11:23:03,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:23:03,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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-12-13 11:23:04,414 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:23:04,414 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 104 treesize of output 47 [2022-12-13 11:23:04,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:04,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 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-12-13 11:23:04,427 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:23:04,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2022-12-13 11:23:04,432 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-12-13 11:23:04,655 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_3457 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3457))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_3456 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3456))) (exists ((v_ArrVal_3453 Int)) (and (<= 8 v_ArrVal_3453) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_3453) |c_#length|))))) is different from true [2022-12-13 11:23:04,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:04,703 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 11:23:04,703 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 84 [2022-12-13 11:23:04,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:04,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:04,713 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-12-13 11:23:04,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:04,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:04,721 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-13 11:23:04,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 38 treesize of output 33 [2022-12-13 11:23:04,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:04,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:04,742 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 11:23:04,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 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-12-13 11:23:05,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:05,580 INFO L321 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-12-13 11:23:05,580 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 1 case distinctions, treesize of input 32 treesize of output 34 [2022-12-13 11:23:05,610 INFO L321 Elim1Store]: treesize reduction 65, result has 30.1 percent of original size [2022-12-13 11:23:05,610 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 5 case distinctions, treesize of input 124 treesize of output 84 [2022-12-13 11:23:06,156 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:23:06,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:06,159 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:23:06,159 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 128 treesize of output 60 [2022-12-13 11:23:06,169 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 11:23:06,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2022-12-13 11:23:06,613 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2022-12-13 11:23:06,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:23:09,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755855060] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:23:09,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:23:09,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 30] total 66 [2022-12-13 11:23:09,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441456747] [2022-12-13 11:23:09,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:23:09,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-12-13 11:23:09,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:23:09,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-12-13 11:23:09,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=5585, Unknown=8, NotChecked=150, Total=6006 [2022-12-13 11:23:09,257 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand has 67 states, 64 states have (on average 1.703125) internal successors, (109), 59 states have internal predecessors, (109), 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-12-13 11:23:47,142 WARN L233 SmtUtils]: Spent 6.71s on a formula simplification. DAG size of input: 182 DAG size of output: 165 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:23:50,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:23:50,199 INFO L93 Difference]: Finished difference Result 174 states and 189 transitions. [2022-12-13 11:23:50,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-13 11:23:50,199 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 64 states have (on average 1.703125) internal successors, (109), 59 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 61 [2022-12-13 11:23:50,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:23:50,199 INFO L225 Difference]: With dead ends: 174 [2022-12-13 11:23:50,199 INFO L226 Difference]: Without dead ends: 174 [2022-12-13 11:23:50,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2554 ImplicationChecksByTransitivity, 43.0s TimeCoverageRelationStatistics Valid=1381, Invalid=12184, Unknown=11, NotChecked=230, Total=13806 [2022-12-13 11:23:50,200 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1352 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 42 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1352 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 2563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:23:50,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1352 Valid, 983 Invalid, 2563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2392 Invalid, 3 Unknown, 126 Unchecked, 3.1s Time] [2022-12-13 11:23:50,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-12-13 11:23:50,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 111. [2022-12-13 11:23:50,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 93 states have (on average 1.2043010752688172) internal successors, (112), 104 states have internal predecessors, (112), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 11:23:50,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2022-12-13 11:23:50,203 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 61 [2022-12-13 11:23:50,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:23:50,203 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2022-12-13 11:23:50,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 64 states have (on average 1.703125) internal successors, (109), 59 states have internal predecessors, (109), 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-12-13 11:23:50,203 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2022-12-13 11:23:50,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 11:23:50,203 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:23:50,204 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 11:23:50,209 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 11:23:50,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 11:23:50,405 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:23:50,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:23:50,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1413927454, now seen corresponding path program 1 times [2022-12-13 11:23:50,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:23:50,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634118467] [2022-12-13 11:23:50,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:23:50,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:23:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:52,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:23:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:52,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:23:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:52,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:23:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:53,510 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 11:23:53,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:23:53,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634118467] [2022-12-13 11:23:53,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634118467] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:23:53,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696703198] [2022-12-13 11:23:53,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:23:53,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:23:53,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:23:53,511 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:23:53,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 11:23:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:53,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 173 conjunts are in the unsatisfiable core [2022-12-13 11:23:53,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:23:53,753 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-12-13 11:23:53,816 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-12-13 11:23:53,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 11:23:54,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:54,184 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-12-13 11:23:54,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:54,346 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-12-13 11:23:54,524 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-12-13 11:23:54,529 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-12-13 11:23:54,531 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-12-13 11:23:55,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:55,063 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 12 treesize of output 14 [2022-12-13 11:23:55,083 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 11:23:55,083 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 14 treesize of output 20 [2022-12-13 11:23:55,094 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-12-13 11:23:55,108 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 11:23:55,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 11:23:55,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:23:55,332 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 20 treesize of output 22 [2022-12-13 11:23:55,340 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-12-13 11:23:56,035 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:23:56,035 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 91 treesize of output 42 [2022-12-13 11:23:56,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:56,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-12-13 11:23:56,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-12-13 11:23:56,049 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-12-13 11:23:56,052 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-12-13 11:23:56,350 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_3660 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3660) |c_#memory_$Pointer$.base|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3659 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3659) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3654 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_3654) |c_#length|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_3658 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |node_create_~temp~0#1.base| v_ArrVal_3658))))) is different from true [2022-12-13 11:23:56,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:56,407 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 11:23:56,407 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 101 treesize of output 81 [2022-12-13 11:23:56,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:56,422 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 22 treesize of output 24 [2022-12-13 11:23:56,443 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 11:23:56,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-12-13 11:23:56,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:56,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:56,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 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-12-13 11:23:56,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:56,462 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 12 treesize of output 14 [2022-12-13 11:23:57,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:57,651 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 13 treesize of output 9 [2022-12-13 11:23:58,063 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-12-13 11:23:58,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 224 treesize of output 175 [2022-12-13 11:23:58,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:58,100 INFO L321 Elim1Store]: treesize reduction 112, result has 16.4 percent of original size [2022-12-13 11:23:58,100 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 6 new quantified variables, introduced 4 case distinctions, treesize of input 172 treesize of output 116 [2022-12-13 11:23:58,106 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:23:58,107 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 55 treesize of output 40 [2022-12-13 11:23:58,790 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:23:58,790 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:23:58,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:58,798 INFO L321 Elim1Store]: treesize reduction 3, result has 70.0 percent of original size [2022-12-13 11:23:58,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 54 [2022-12-13 11:23:58,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:58,809 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 11:23:58,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2022-12-13 11:23:59,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:23:59,246 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:23:59,246 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 15 treesize of output 10 [2022-12-13 11:23:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-13 11:23:59,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:24:00,401 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_23| Int) (v_ArrVal_3663 (Array Int Int)) (v_ArrVal_3661 Int) (v_ArrVal_3662 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 v_ArrVal_3662)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_3663))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ .cse4 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 v_ArrVal_3661)) (select (select .cse1 .cse2) .cse3)) |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)) (not (<= 0 .cse4)) (< (select (select .cse5 .cse2) .cse3) |v_ULTIMATE.start_main_~ptr~0#1.offset_23|))))))) is different from false [2022-12-13 11:24:03,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696703198] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:24:03,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:24:03,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 77 [2022-12-13 11:24:03,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087842396] [2022-12-13 11:24:03,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:24:03,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-12-13 11:24:03,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:24:03,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-12-13 11:24:03,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=7737, Unknown=13, NotChecked=354, Total=8372 [2022-12-13 11:24:03,972 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 77 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 69 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-12-13 11:24:23,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:24:23,957 INFO L93 Difference]: Finished difference Result 167 states and 183 transitions. [2022-12-13 11:24:23,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-13 11:24:23,957 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 69 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 65 [2022-12-13 11:24:23,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:24:23,957 INFO L225 Difference]: With dead ends: 167 [2022-12-13 11:24:23,958 INFO L226 Difference]: Without dead ends: 167 [2022-12-13 11:24:23,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 124 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1970 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=1201, Invalid=14043, Unknown=16, NotChecked=490, Total=15750 [2022-12-13 11:24:23,959 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1355 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 3732 mSolverCounterSat, 65 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 3917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3732 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-12-13 11:24:23,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 1418 Invalid, 3917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3732 Invalid, 5 Unknown, 115 Unchecked, 3.8s Time] [2022-12-13 11:24:23,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-12-13 11:24:23,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 116. [2022-12-13 11:24:23,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.1938775510204083) internal successors, (117), 109 states have internal predecessors, (117), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 11:24:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2022-12-13 11:24:23,961 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 65 [2022-12-13 11:24:23,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:24:23,961 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2022-12-13 11:24:23,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 69 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-12-13 11:24:23,961 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2022-12-13 11:24:23,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 11:24:23,962 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:24:23,962 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:24:23,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-13 11:24:24,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 11:24:24,163 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:24:24,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:24:24,164 INFO L85 PathProgramCache]: Analyzing trace with hash -655878667, now seen corresponding path program 3 times [2022-12-13 11:24:24,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:24:24,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654630455] [2022-12-13 11:24:24,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:24:24,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:24:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:24,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:24:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:24,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:24:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:24,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 11:24:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:24,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 11:24:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:24,298 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-12-13 11:24:24,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:24:24,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654630455] [2022-12-13 11:24:24,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654630455] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:24:24,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552100373] [2022-12-13 11:24:24,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 11:24:24,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:24:24,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:24:24,299 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:24:24,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 11:24:24,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 11:24:24,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:24:24,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 11:24:24,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:24:24,792 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 11:24:24,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:24:24,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552100373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:24:24,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 11:24:24,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-12-13 11:24:24,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149188083] [2022-12-13 11:24:24,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:24:24,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:24:24,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:24:24,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:24:24,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:24:24,794 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 11:24:24,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:24:24,805 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-12-13 11:24:24,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:24:24,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 66 [2022-12-13 11:24:24,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:24:24,806 INFO L225 Difference]: With dead ends: 77 [2022-12-13 11:24:24,806 INFO L226 Difference]: Without dead ends: 77 [2022-12-13 11:24:24,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:24:24,806 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 138 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:24:24,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 81 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 11:24:24,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-12-13 11:24:24,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-12-13 11:24:24,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 72 states have internal predecessors, (75), 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-12-13 11:24:24,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2022-12-13 11:24:24,809 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 66 [2022-12-13 11:24:24,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:24:24,809 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2022-12-13 11:24:24,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 11:24:24,810 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-12-13 11:24:24,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 11:24:24,810 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:24:24,810 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 11:24:24,816 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 11:24:25,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 11:24:25,011 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:24:25,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:24:25,011 INFO L85 PathProgramCache]: Analyzing trace with hash -882077631, now seen corresponding path program 2 times [2022-12-13 11:24:25,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:24:25,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249029776] [2022-12-13 11:24:25,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:24:25,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:24:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:27,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:24:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:27,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:24:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:27,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:24:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:28,050 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 11:24:28,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:24:28,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249029776] [2022-12-13 11:24:28,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249029776] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:24:28,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51624601] [2022-12-13 11:24:28,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 11:24:28,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:24:28,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:24:28,052 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:24:28,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 11:24:28,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 11:24:28,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:24:28,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 159 conjunts are in the unsatisfiable core [2022-12-13 11:24:28,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:24:28,292 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-12-13 11:24:28,368 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:24:28,368 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-12-13 11:24:28,563 INFO L321 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2022-12-13 11:24:28,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 29 [2022-12-13 11:24:28,844 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-13 11:24:28,844 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 16 treesize of output 18 [2022-12-13 11:24:28,935 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-12-13 11:24:29,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:24:29,036 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 21 treesize of output 20 [2022-12-13 11:24:29,168 INFO L321 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2022-12-13 11:24:29,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 41 [2022-12-13 11:24:29,420 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 23 treesize of output 13 [2022-12-13 11:24:29,949 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:24:29,950 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 59 treesize of output 26 [2022-12-13 11:24:29,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-12-13 11:24:29,970 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-12-13 11:24:29,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-12-13 11:24:30,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:24:30,401 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 11:24:30,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 55 [2022-12-13 11:24:30,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:24:30,436 INFO L321 Elim1Store]: treesize reduction 108, result has 28.5 percent of original size [2022-12-13 11:24:30,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 44 treesize of output 73 [2022-12-13 11:24:30,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:24:30,459 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-12-13 11:24:31,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:24:31,600 INFO L321 Elim1Store]: treesize reduction 97, result has 19.8 percent of original size [2022-12-13 11:24:31,600 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 154 treesize of output 88 [2022-12-13 11:24:31,616 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-12-13 11:24:31,617 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 259 treesize of output 223 [2022-12-13 11:24:32,278 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-12-13 11:24:32,279 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 259 treesize of output 161 [2022-12-13 11:24:33,124 INFO L321 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2022-12-13 11:24:33,124 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 50 [2022-12-13 11:24:33,700 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 11:24:33,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:24:35,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51624601] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:24:35,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:24:35,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 37] total 80 [2022-12-13 11:24:35,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462229527] [2022-12-13 11:24:35,794 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:24:35,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-12-13 11:24:35,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:24:35,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-12-13 11:24:35,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=8818, Unknown=2, NotChecked=0, Total=9120 [2022-12-13 11:24:35,795 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 81 states, 78 states have (on average 1.5384615384615385) internal successors, (120), 72 states have internal predecessors, (120), 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-12-13 11:24:54,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:24:54,988 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2022-12-13 11:24:54,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-13 11:24:54,989 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 78 states have (on average 1.5384615384615385) internal successors, (120), 72 states have internal predecessors, (120), 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-12-13 11:24:54,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:24:54,989 INFO L225 Difference]: With dead ends: 100 [2022-12-13 11:24:54,989 INFO L226 Difference]: Without dead ends: 100 [2022-12-13 11:24:54,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3358 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=1389, Invalid=15900, Unknown=3, NotChecked=0, Total=17292 [2022-12-13 11:24:54,990 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 1126 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 3108 mSolverCounterSat, 49 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 3159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 3108 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-12-13 11:24:54,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 1029 Invalid, 3159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 3108 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2022-12-13 11:24:54,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-12-13 11:24:54,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2022-12-13 11:24:54,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.2) internal successors, (78), 74 states have internal predecessors, (78), 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-12-13 11:24:54,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2022-12-13 11:24:54,992 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 66 [2022-12-13 11:24:54,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:24:54,992 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2022-12-13 11:24:54,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 78 states have (on average 1.5384615384615385) internal successors, (120), 72 states have internal predecessors, (120), 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-12-13 11:24:54,992 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-12-13 11:24:54,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 11:24:54,992 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:24:54,993 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 11:24:54,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-13 11:24:55,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 11:24:55,194 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:24:55,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:24:55,195 INFO L85 PathProgramCache]: Analyzing trace with hash -882077630, now seen corresponding path program 2 times [2022-12-13 11:24:55,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:24:55,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226335348] [2022-12-13 11:24:55,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:24:55,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:24:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:57,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:24:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:57,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:24:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:57,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:24:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:58,424 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 11:24:58,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:24:58,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226335348] [2022-12-13 11:24:58,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226335348] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:24:58,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482634038] [2022-12-13 11:24:58,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 11:24:58,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:24:58,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:24:58,425 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:24:58,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 11:24:58,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 11:24:58,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:24:58,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 204 conjunts are in the unsatisfiable core [2022-12-13 11:24:58,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:24:58,641 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-12-13 11:24:58,644 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-12-13 11:24:58,711 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-12-13 11:24:58,713 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-12-13 11:24:58,879 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:24:58,879 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-12-13 11:24:58,882 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-12-13 11:24:59,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-13 11:24:59,204 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-12-13 11:24:59,209 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-12-13 11:24:59,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:24:59,280 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 21 treesize of output 20 [2022-12-13 11:24:59,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:24:59,287 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 21 treesize of output 20 [2022-12-13 11:24:59,396 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:24:59,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 11:24:59,420 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 11:24:59,421 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-12-13 11:24:59,652 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 23 treesize of output 13 [2022-12-13 11:24:59,668 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 23 treesize of output 13 [2022-12-13 11:25:00,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-12-13 11:25:00,178 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:25:00,179 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 68 treesize of output 35 [2022-12-13 11:25:00,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-13 11:25:00,193 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:25:00,193 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 1 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 11:25:00,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:25:00,718 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 11:25:00,718 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 76 treesize of output 68 [2022-12-13 11:25:00,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:25:00,725 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 20 treesize of output 22 [2022-12-13 11:25:00,741 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 11:25:00,742 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 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-13 11:25:00,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:25:00,751 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 11:25:00,752 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 1 case distinctions, treesize of input 25 treesize of output 30 [2022-12-13 11:25:02,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:25:02,256 INFO L321 Elim1Store]: treesize reduction 96, result has 17.9 percent of original size [2022-12-13 11:25:02,256 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 223 treesize of output 116 [2022-12-13 11:25:02,280 INFO L321 Elim1Store]: treesize reduction 128, result has 14.7 percent of original size [2022-12-13 11:25:02,281 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 229 treesize of output 141 [2022-12-13 11:25:05,294 INFO L321 Elim1Store]: treesize reduction 184, result has 59.7 percent of original size [2022-12-13 11:25:05,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 2 disjoint index pairs (out of 36 index pairs), introduced 15 new quantified variables, introduced 36 case distinctions, treesize of input 379 treesize of output 457 [2022-12-13 11:25:05,820 INFO L321 Elim1Store]: treesize reduction 152, result has 60.1 percent of original size [2022-12-13 11:25:05,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 2 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 465 treesize of output 563 [2022-12-13 11:25:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 11:25:16,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:25:30,752 WARN L233 SmtUtils]: Spent 6.68s on a formula simplification that was a NOOP. DAG size: 101 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:25:30,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482634038] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:25:30,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:25:30,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42] total 82 [2022-12-13 11:25:30,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625301201] [2022-12-13 11:25:30,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:25:30,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-12-13 11:25:30,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:25:30,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-12-13 11:25:30,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=10391, Unknown=0, NotChecked=0, Total=10712 [2022-12-13 11:25:30,756 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 83 states, 80 states have (on average 1.4875) internal successors, (119), 74 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-12-13 11:25:53,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:25:53,345 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-12-13 11:25:53,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-13 11:25:53,346 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 80 states have (on average 1.4875) internal successors, (119), 74 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 66 [2022-12-13 11:25:53,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:25:53,346 INFO L225 Difference]: With dead ends: 96 [2022-12-13 11:25:53,347 INFO L226 Difference]: Without dead ends: 96 [2022-12-13 11:25:53,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4185 ImplicationChecksByTransitivity, 37.2s TimeCoverageRelationStatistics Valid=1282, Invalid=18740, Unknown=0, NotChecked=0, Total=20022 [2022-12-13 11:25:53,348 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 861 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 3479 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 3512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-12-13 11:25:53,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 1139 Invalid, 3512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3479 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-12-13 11:25:53,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-12-13 11:25:53,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 81. [2022-12-13 11:25:53,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 76 states have internal predecessors, (79), 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-12-13 11:25:53,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2022-12-13 11:25:53,349 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 66 [2022-12-13 11:25:53,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:25:53,350 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2022-12-13 11:25:53,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 80 states have (on average 1.4875) internal successors, (119), 74 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-12-13 11:25:53,350 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-12-13 11:25:53,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-13 11:25:53,350 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:25:53,350 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2022-12-13 11:25:53,357 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-13 11:25:53,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:25:53,551 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:25:53,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:25:53,553 INFO L85 PathProgramCache]: Analyzing trace with hash 642840936, now seen corresponding path program 2 times [2022-12-13 11:25:53,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:25:53,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99093506] [2022-12-13 11:25:53,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:25:53,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:25:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:55,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:25:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:55,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:25:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:55,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:25:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:56,462 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 5 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 11:25:56,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:25:56,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99093506] [2022-12-13 11:25:56,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99093506] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:25:56,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582454101] [2022-12-13 11:25:56,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 11:25:56,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:25:56,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:25:56,464 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:25:56,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 11:25:56,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 11:25:56,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:25:56,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 209 conjunts are in the unsatisfiable core [2022-12-13 11:25:56,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:25:56,749 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-12-13 11:25:56,803 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-12-13 11:25:56,937 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 |c_ULTIMATE.start_sll_create_#t~ret5#1.offset|) (exists ((|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |c_#valid|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1)) is different from false [2022-12-13 11:25:56,939 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 |c_ULTIMATE.start_sll_create_#t~ret5#1.offset|) (exists ((|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |c_#valid|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1)) is different from true [2022-12-13 11:25:56,955 WARN L837 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |c_#valid|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)) is different from false [2022-12-13 11:25:56,958 WARN L859 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |c_#valid|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)) is different from true [2022-12-13 11:25:56,998 WARN L837 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (<= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |c_#valid|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |c_#valid| .cse0))))))) is different from false [2022-12-13 11:25:57,000 WARN L859 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (<= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |c_#valid|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |c_#valid| .cse0))))))) is different from true [2022-12-13 11:25:57,049 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1)))) is different from false [2022-12-13 11:25:57,051 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1)))) is different from true [2022-12-13 11:25:57,070 WARN L837 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((v_ArrVal_4451 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_4451))) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2022-12-13 11:25:57,073 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((v_ArrVal_4451 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_4451))) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2022-12-13 11:25:57,106 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-12-13 11:25:57,111 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-12-13 11:25:57,115 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_node_create_~temp~0#1.offset| 4))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) .cse0) 0) (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((v_ArrVal_4451 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_4451))) (= (select (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) .cse0) 0) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0))) is different from false [2022-12-13 11:25:57,117 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_node_create_~temp~0#1.offset| 4))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) .cse0) 0) (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((v_ArrVal_4451 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_4451))) (= (select (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) .cse0) 0) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0))) is different from true [2022-12-13 11:25:57,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:25:57,124 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 21 treesize of output 20 [2022-12-13 11:25:57,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:25:57,140 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 21 treesize of output 20 [2022-12-13 11:25:57,169 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_node_create_#res#1.offset| 4))) (and (= |c_node_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|) .cse0) 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((v_ArrVal_4451 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_4451))) (not (= |c_node_create_#res#1.base| 0)) (= (select (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|) .cse0) 0))) is different from false [2022-12-13 11:25:57,171 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_node_create_#res#1.offset| 4))) (and (= |c_node_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|) .cse0) 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((v_ArrVal_4451 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_4451))) (not (= |c_node_create_#res#1.base| 0)) (= (select (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|) .cse0) 0))) is different from true [2022-12-13 11:25:57,255 WARN L837 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (<= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_#t~ret5#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (not (= |c_ULTIMATE.start_sll_create_#t~ret5#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 4) 0)) is different from false [2022-12-13 11:25:57,258 WARN L859 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (<= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_#t~ret5#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (not (= |c_ULTIMATE.start_sll_create_#t~ret5#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 4) 0)) is different from true [2022-12-13 11:25:57,316 WARN L837 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2022-12-13 11:25:57,320 WARN L859 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2022-12-13 11:25:57,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:25:57,334 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 13 [2022-12-13 11:25:57,354 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:25:57,355 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 13 [2022-12-13 11:25:57,389 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (<= .cse1 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 .cse1) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse2 (select |v_#valid_BEFORE_CALL_70| .cse2)))) (= (select |v_#valid_BEFORE_CALL_70| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_71| .cse3) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)))) is different from false [2022-12-13 11:25:57,392 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (<= .cse1 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 .cse1) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse2 (select |v_#valid_BEFORE_CALL_70| .cse2)))) (= (select |v_#valid_BEFORE_CALL_70| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_71| .cse3) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)))) is different from true [2022-12-13 11:25:57,447 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_70| .cse1) 1)))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse3 (select |v_#valid_BEFORE_CALL_69| .cse3)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (<= .cse4 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 .cse4) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2022-12-13 11:25:57,451 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_70| .cse1) 1)))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse3 (select |v_#valid_BEFORE_CALL_69| .cse3)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (<= .cse4 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 .cse4) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from true [2022-12-13 11:25:57,601 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 .cse1) (<= .cse1 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse2 (select |v_#valid_BEFORE_CALL_70| .cse2)))) (= (select |v_#valid_BEFORE_CALL_70| .cse3) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| .cse3) 0)))))) is different from false [2022-12-13 11:25:57,605 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 .cse1) (<= .cse1 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse2 (select |v_#valid_BEFORE_CALL_70| .cse2)))) (= (select |v_#valid_BEFORE_CALL_70| .cse3) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| .cse3) 0)))))) is different from true [2022-12-13 11:25:57,675 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (and (<= 0 .cse0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_append_~data#1|) (= (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_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse3 (select |v_#valid_BEFORE_CALL_70| .cse3)))) (= (select |v_#valid_BEFORE_CALL_71| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_70| .cse4) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| .cse2 v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (not (= 0 .cse2))))) is different from false [2022-12-13 11:25:57,678 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (and (<= 0 .cse0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_append_~data#1|) (= (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_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse3 (select |v_#valid_BEFORE_CALL_70| .cse3)))) (= (select |v_#valid_BEFORE_CALL_71| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_70| .cse4) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| .cse2 v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (not (= 0 .cse2))))) is different from true [2022-12-13 11:25:57,704 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:25:57,704 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 66 treesize of output 37 [2022-12-13 11:25:57,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:25:57,711 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 22 treesize of output 10 [2022-12-13 11:25:57,740 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from false [2022-12-13 11:25:57,743 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from true [2022-12-13 11:25:57,799 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_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2022-12-13 11:25:57,803 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_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2022-12-13 11:25:57,898 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_4465 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_4465) |c_#memory_$Pointer$.offset|)) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_4464 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4464) |c_#memory_$Pointer$.base|))) is different from false [2022-12-13 11:25:57,902 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_4465 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_4465) |c_#memory_$Pointer$.offset|)) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_4464 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4464) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 11:25:57,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 11:25:57,956 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4469 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4469))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((v_ArrVal_4468 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_4468))) (= |c_node_create_#in~data#1| (select (select |c_#memory_int| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset|)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2022-12-13 11:25:57,959 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4469 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4469))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((v_ArrVal_4468 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_4468))) (= |c_node_create_#in~data#1| (select (select |c_#memory_int| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset|)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2022-12-13 11:25:58,013 WARN L837 $PredicateComparison]: unable to prove that (and (= |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) (exists ((v_ArrVal_4469 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_4469))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) |c_node_create_#res#1.offset|) |c_node_create_#in~data#1|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (exists ((v_ArrVal_4468 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_4468)))) is different from false [2022-12-13 11:25:58,016 WARN L859 $PredicateComparison]: unable to prove that (and (= |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) (exists ((v_ArrVal_4469 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_4469))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) |c_node_create_#res#1.offset|) |c_node_create_#in~data#1|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (exists ((v_ArrVal_4468 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_4468)))) is different from true [2022-12-13 11:25:58,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:25:58,111 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 11:25:58,112 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 84 treesize of output 76 [2022-12-13 11:25:58,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:25:58,128 INFO L321 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2022-12-13 11:25:58,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 43 [2022-12-13 11:25:58,190 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_append_#t~ret7#1.base| 2)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (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_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse2 (select |v_#valid_BEFORE_CALL_69| .cse2)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) 4))) (and (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse4 (select |v_#valid_BEFORE_CALL_75| .cse4))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse5) 0)))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 .cse3)) (or (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (and (<= 0 .cse6) (<= .cse6 0))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse3)))) is different from false [2022-12-13 11:25:58,195 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_append_#t~ret7#1.base| 2)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (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_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse2 (select |v_#valid_BEFORE_CALL_69| .cse2)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) 4))) (and (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse4 (select |v_#valid_BEFORE_CALL_75| .cse4))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse5) 0)))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 .cse3)) (or (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (and (<= 0 .cse6) (<= .cse6 0))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse3)))) is different from true [2022-12-13 11:25:58,344 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (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_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse5 (select |v_#valid_BEFORE_CALL_70| .cse5)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse0) 4))) (and (<= 0 .cse6) (<= .cse6 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))) is different from false [2022-12-13 11:25:58,349 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (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_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse5 (select |v_#valid_BEFORE_CALL_70| .cse5)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse0) 4))) (and (<= 0 .cse6) (<= .cse6 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))) is different from true [2022-12-13 11:25:58,646 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse5 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse6 (select |v_#valid_BEFORE_CALL_70| .cse6)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_#t~mem9#1.offset| .cse5) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_append_#t~mem9#1.base| .cse0) (or (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse0) 4))) (and (<= 0 .cse7) (<= .cse7 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))) is different from false [2022-12-13 11:25:58,651 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse5 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse6 (select |v_#valid_BEFORE_CALL_70| .cse6)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_#t~mem9#1.offset| .cse5) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_append_#t~mem9#1.base| .cse0) (or (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse0) 4))) (and (<= 0 .cse7) (<= .cse7 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))) is different from true [2022-12-13 11:25:58,821 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse5 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse6 (select |v_#valid_BEFORE_CALL_70| .cse6)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse0) (or (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse0) 4))) (and (<= 0 .cse7) (<= .cse7 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse5) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))) is different from false [2022-12-13 11:25:58,826 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse5 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse6 (select |v_#valid_BEFORE_CALL_70| .cse6)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse0) (or (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse0) 4))) (and (<= 0 .cse7) (<= .cse7 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse5) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))) is different from true [2022-12-13 11:25:59,127 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse0)) (.cse9 (+ .cse6 4)) (.cse4 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse8 (select |c_#memory_$Pointer$.offset| .cse0))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select .cse3 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse5 (select |v_#valid_BEFORE_CALL_69| .cse5)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse6 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse4 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= (select .cse8 .cse9) |c_ULTIMATE.start_sll_append_#t~mem10#1.offset|) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select .cse3 .cse9) |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (let ((.cse10 (select .cse8 4))) (and (<= 0 .cse10) (<= .cse10 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) is different from false [2022-12-13 11:25:59,131 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse0)) (.cse9 (+ .cse6 4)) (.cse4 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse8 (select |c_#memory_$Pointer$.offset| .cse0))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select .cse3 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse5 (select |v_#valid_BEFORE_CALL_69| .cse5)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse6 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse4 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= (select .cse8 .cse9) |c_ULTIMATE.start_sll_append_#t~mem10#1.offset|) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select .cse3 .cse9) |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (let ((.cse10 (select .cse8 4))) (and (<= 0 .cse10) (<= .cse10 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) is different from true [2022-12-13 11:25:59,249 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| .cse0)) (.cse9 (+ .cse6 4)) (.cse8 (select |c_#memory_$Pointer$.offset| .cse0))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select .cse3 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse5 (select |v_#valid_BEFORE_CALL_69| .cse5)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse6 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse4 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse8 .cse9)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse3 .cse9) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (let ((.cse10 (select .cse8 4))) (and (<= 0 .cse10) (<= .cse10 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) is different from false [2022-12-13 11:25:59,254 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| .cse0)) (.cse9 (+ .cse6 4)) (.cse8 (select |c_#memory_$Pointer$.offset| .cse0))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select .cse3 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse5 (select |v_#valid_BEFORE_CALL_69| .cse5)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse6 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse4 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse8 .cse9)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse3 .cse9) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (let ((.cse10 (select .cse8 4))) (and (<= 0 .cse10) (<= .cse10 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) is different from true [2022-12-13 11:25:59,391 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| .cse0)) (.cse9 (+ .cse6 4)) (.cse8 (select |c_#memory_$Pointer$.offset| .cse0))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select .cse3 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse5 (select |v_#valid_BEFORE_CALL_69| .cse5)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse6 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse4 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse8 .cse9)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_sll_append_#t~mem11#1.base|) (= (select .cse3 .cse9) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (let ((.cse10 (select .cse8 4))) (and (<= 0 .cse10) (<= .cse10 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) is different from false [2022-12-13 11:25:59,395 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| .cse0)) (.cse9 (+ .cse6 4)) (.cse8 (select |c_#memory_$Pointer$.offset| .cse0))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select .cse3 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse5 (select |v_#valid_BEFORE_CALL_69| .cse5)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse6 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse4 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse8 .cse9)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_sll_append_#t~mem11#1.base|) (= (select .cse3 .cse9) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (let ((.cse10 (select .cse8 4))) (and (<= 0 .cse10) (<= .cse10 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) is different from true [2022-12-13 11:25:59,545 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| .cse0)) (.cse9 (+ .cse6 4)) (.cse8 (select |c_#memory_$Pointer$.offset| .cse0))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select .cse3 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse5 (select |v_#valid_BEFORE_CALL_69| .cse5)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse6 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse4 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse8 .cse9)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse3 .cse9) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (let ((.cse10 (select .cse8 4))) (and (<= 0 .cse10) (<= .cse10 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) is different from false [2022-12-13 11:25:59,550 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| .cse0)) (.cse9 (+ .cse6 4)) (.cse8 (select |c_#memory_$Pointer$.offset| .cse0))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select .cse3 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse5 (select |v_#valid_BEFORE_CALL_69| .cse5)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse6 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse4 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse8 .cse9)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse3 .cse9) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (let ((.cse10 (select .cse8 4))) (and (<= 0 .cse10) (<= .cse10 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) is different from true [2022-12-13 11:25:59,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:25:59,590 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:25:59,639 INFO L321 Elim1Store]: treesize reduction 139, result has 14.7 percent of original size [2022-12-13 11:25:59,640 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 7 new quantified variables, introduced 9 case distinctions, treesize of input 254 treesize of output 130 [2022-12-13 11:25:59,701 INFO L321 Elim1Store]: treesize reduction 128, result has 14.7 percent of original size [2022-12-13 11:25:59,702 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 390 treesize of output 246 [2022-12-13 11:25:59,780 INFO L321 Elim1Store]: treesize reduction 63, result has 49.2 percent of original size [2022-12-13 11:25:59,781 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 44 treesize of output 80 [2022-12-13 11:25:59,785 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-12-13 11:25:59,891 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse6 (+ .cse0 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse3 (+ 2 .cse1))) (and (or (and (<= 0 .cse0) (<= .cse0 0)) (= .cse1 .cse2)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse5 .cse1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 0))) (not (= 0 .cse2)) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_75| .cse2 1) .cse1) 0) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse8 (select |v_#valid_BEFORE_CALL_75| .cse8))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse5) 0))))))))) is different from false [2022-12-13 11:25:59,897 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse6 (+ .cse0 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse3 (+ 2 .cse1))) (and (or (and (<= 0 .cse0) (<= .cse0 0)) (= .cse1 .cse2)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse5 .cse1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 0))) (not (= 0 .cse2)) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_75| .cse2 1) .cse1) 0) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse8 (select |v_#valid_BEFORE_CALL_75| .cse8))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse5) 0))))))))) is different from true [2022-12-13 11:26:00,667 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse9 (+ .cse1 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse4) .cse9))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (+ 2 .cse6))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= (select |v_#valid_BEFORE_CALL_75| .cse4) 1) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse1 0) (= .cse5 |c_ULTIMATE.start_main_#t~mem13#1.offset|) (= .cse5 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse6) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse7 (select |v_#valid_BEFORE_CALL_69| .cse7)))) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse8 (select |v_#valid_BEFORE_CALL_75| .cse8))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse4) .cse9) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse6) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1)))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2022-12-13 11:26:00,673 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse9 (+ .cse1 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse4) .cse9))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (+ 2 .cse6))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= (select |v_#valid_BEFORE_CALL_75| .cse4) 1) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse1 0) (= .cse5 |c_ULTIMATE.start_main_#t~mem13#1.offset|) (= .cse5 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse6) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse7 (select |v_#valid_BEFORE_CALL_69| .cse7)))) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse8 (select |v_#valid_BEFORE_CALL_75| .cse8))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse4) .cse9) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse6) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1)))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2022-12-13 11:26:00,912 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| .cse0) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse9 (+ .cse2 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse4) .cse9))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (+ 2 .cse6))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse2) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (not (= .cse0 0)) (= (select |v_#valid_BEFORE_CALL_75| .cse4) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse2 0) (= .cse5 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse6) 0)) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse7 (select |v_#valid_BEFORE_CALL_69| .cse7)))) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse8 (select |v_#valid_BEFORE_CALL_75| .cse8))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse4) .cse9) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) .cse6) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1)))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2022-12-13 11:26:00,916 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| .cse0) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse9 (+ .cse2 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse4) .cse9))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (+ 2 .cse6))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse2) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (not (= .cse0 0)) (= (select |v_#valid_BEFORE_CALL_75| .cse4) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse2 0) (= .cse5 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse6) 0)) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse7 (select |v_#valid_BEFORE_CALL_69| .cse7)))) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse8 (select |v_#valid_BEFORE_CALL_75| .cse8))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse4) .cse9) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) .cse6) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1)))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2022-12-13 11:26:01,283 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse10 (select |c_#memory_$Pointer$.offset| .cse3))) (let ((.cse1 (select .cse10 4)) (.cse6 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse4 (select .cse6 4)) (.cse12 (+ .cse1 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse4) .cse12))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (+ 2 .cse8)) (.cse7 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= (select |v_#valid_BEFORE_CALL_75| .cse4) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select .cse6 .cse7) |c_ULTIMATE.start_main_#t~mem14#1.base|) (<= .cse1 0) (= .cse5 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse9 (select |v_#valid_BEFORE_CALL_69| .cse9)))) (= |c_ULTIMATE.start_main_#t~mem14#1.offset| (select .cse10 .cse7)) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse11 (select |v_#valid_BEFORE_CALL_75| .cse11))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse4) .cse12) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse8) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2022-12-13 11:26:01,288 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse10 (select |c_#memory_$Pointer$.offset| .cse3))) (let ((.cse1 (select .cse10 4)) (.cse6 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse4 (select .cse6 4)) (.cse12 (+ .cse1 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse4) .cse12))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (+ 2 .cse8)) (.cse7 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= (select |v_#valid_BEFORE_CALL_75| .cse4) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select .cse6 .cse7) |c_ULTIMATE.start_main_#t~mem14#1.base|) (<= .cse1 0) (= .cse5 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse9 (select |v_#valid_BEFORE_CALL_69| .cse9)))) (= |c_ULTIMATE.start_main_#t~mem14#1.offset| (select .cse10 .cse7)) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse11 (select |v_#valid_BEFORE_CALL_75| .cse11))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse4) .cse12) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse8) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2022-12-13 11:26:01,507 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| .cse3))) (let ((.cse1 (select .cse6 4)) (.cse11 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse4 (select .cse11 4)) (.cse12 (+ .cse1 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse4) .cse12))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (+ 2 .cse8)) (.cse7 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= (select |v_#valid_BEFORE_CALL_75| .cse4) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse1 0) (= .cse5 0) (= |c_ULTIMATE.start_main_~temp~2#1.offset| (select .cse6 .cse7)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse9 (select |v_#valid_BEFORE_CALL_69| .cse9)))) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse10 (select |v_#valid_BEFORE_CALL_75| .cse10))) |v_#valid_BEFORE_CALL_75|) (= (select .cse11 .cse7) |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse4) .cse12) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse8) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1)))))))))) is different from false [2022-12-13 11:26:01,513 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| .cse3))) (let ((.cse1 (select .cse6 4)) (.cse11 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse4 (select .cse11 4)) (.cse12 (+ .cse1 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse4) .cse12))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (+ 2 .cse8)) (.cse7 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= (select |v_#valid_BEFORE_CALL_75| .cse4) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse1 0) (= .cse5 0) (= |c_ULTIMATE.start_main_~temp~2#1.offset| (select .cse6 .cse7)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse9 (select |v_#valid_BEFORE_CALL_69| .cse9)))) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse10 (select |v_#valid_BEFORE_CALL_75| .cse10))) |v_#valid_BEFORE_CALL_75|) (= (select .cse11 .cse7) |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse4) .cse12) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse8) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1)))))))))) is different from true [2022-12-13 11:26:01,712 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select |c_#memory_$Pointer$.offset| .cse3))) (let ((.cse1 (select .cse4 4)) (.cse7 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse6 (select .cse7 4)) (.cse12 (+ .cse1 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| .cse6) .cse12)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (+ .cse8 4)) (.cse2 (+ 2 .cse9))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= |c_ULTIMATE.start_main_~temp~2#1.offset| (select .cse4 .cse5)) (= (select |v_#valid_BEFORE_CALL_75| .cse6) 1) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse1 0) (= (select .cse7 .cse5) |c_ULTIMATE.start_main_~temp~2#1.base|) (= .cse8 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse9) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse10 (select |v_#valid_BEFORE_CALL_69| .cse10)))) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse11 (select |v_#valid_BEFORE_CALL_75| .cse11))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse6) .cse12) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse9) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1)))))))))) is different from false [2022-12-13 11:26:01,717 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select |c_#memory_$Pointer$.offset| .cse3))) (let ((.cse1 (select .cse4 4)) (.cse7 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse6 (select .cse7 4)) (.cse12 (+ .cse1 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| .cse6) .cse12)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (+ .cse8 4)) (.cse2 (+ 2 .cse9))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= |c_ULTIMATE.start_main_~temp~2#1.offset| (select .cse4 .cse5)) (= (select |v_#valid_BEFORE_CALL_75| .cse6) 1) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse1 0) (= (select .cse7 .cse5) |c_ULTIMATE.start_main_~temp~2#1.base|) (= .cse8 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse9) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse10 (select |v_#valid_BEFORE_CALL_69| .cse10)))) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse11 (select |v_#valid_BEFORE_CALL_75| .cse11))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse6) .cse12) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse9) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1)))))))))) is different from true [2022-12-13 11:26:01,929 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse12 (select |c_#memory_$Pointer$.offset| .cse3))) (let ((.cse1 (select .cse12 4)) (.cse4 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse6 (select .cse4 4)) (.cse11 (+ .cse1 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse6) .cse11))) (let ((.cse2 (+ 2 .cse8)) (.cse5 (+ .cse7 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse4 .cse5)) (= (select |v_#valid_BEFORE_CALL_75| .cse6) 1) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse1 0) (= .cse7 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse9 (select |v_#valid_BEFORE_CALL_69| .cse9)))) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse10 (select |v_#valid_BEFORE_CALL_75| .cse10))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse6) .cse11) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse8) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1) (= (select .cse12 .cse5) |c_ULTIMATE.start_main_~ptr~0#1.offset|))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2022-12-13 11:26:01,934 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse12 (select |c_#memory_$Pointer$.offset| .cse3))) (let ((.cse1 (select .cse12 4)) (.cse4 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse6 (select .cse4 4)) (.cse11 (+ .cse1 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse6) .cse11))) (let ((.cse2 (+ 2 .cse8)) (.cse5 (+ .cse7 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse4 .cse5)) (= (select |v_#valid_BEFORE_CALL_75| .cse6) 1) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse1 0) (= .cse7 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse9 (select |v_#valid_BEFORE_CALL_69| .cse9)))) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse10 (select |v_#valid_BEFORE_CALL_75| .cse10))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse6) .cse11) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse8) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1) (= (select .cse12 .cse5) |c_ULTIMATE.start_main_~ptr~0#1.offset|))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2022-12-13 11:26:02,226 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse12 (select |c_#memory_$Pointer$.offset| .cse3))) (let ((.cse1 (select .cse12 4)) (.cse4 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse6 (select .cse4 4)) (.cse11 (+ .cse1 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse6) .cse11))) (let ((.cse2 (+ 2 .cse8)) (.cse5 (+ .cse7 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse4 .cse5)) (= (select |v_#valid_BEFORE_CALL_75| .cse6) 1) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse1 0) (= .cse7 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse9 (select |v_#valid_BEFORE_CALL_69| .cse9)))) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse10 (select |v_#valid_BEFORE_CALL_75| .cse10))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse6) .cse11) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse8) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1) (= (select .cse12 .cse5) |c_ULTIMATE.start_main_~ptr~0#1.offset|))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0)))) is different from false [2022-12-13 11:26:02,231 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse12 (select |c_#memory_$Pointer$.offset| .cse3))) (let ((.cse1 (select .cse12 4)) (.cse4 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse6 (select .cse4 4)) (.cse11 (+ .cse1 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse6) .cse11))) (let ((.cse2 (+ 2 .cse8)) (.cse5 (+ .cse7 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse4 .cse5)) (= (select |v_#valid_BEFORE_CALL_75| .cse6) 1) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse1 0) (= .cse7 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse9 (select |v_#valid_BEFORE_CALL_69| .cse9)))) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse10 (select |v_#valid_BEFORE_CALL_75| .cse10))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse6) .cse11) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse8) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1) (= (select .cse12 .cse5) |c_ULTIMATE.start_main_~ptr~0#1.offset|))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0)))) is different from true [2022-12-13 11:26:02,278 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:26:02,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:26:02,311 INFO L321 Elim1Store]: treesize reduction 95, result has 6.9 percent of original size [2022-12-13 11:26:02,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 321 treesize of output 135 [2022-12-13 11:26:02,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:26:02,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:26:02,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:26:02,353 INFO L321 Elim1Store]: treesize reduction 12, result has 36.8 percent of original size [2022-12-13 11:26:02,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 35 [2022-12-13 11:26:02,477 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_#t~mem14#1.base|))) (and (= |c_ULTIMATE.start_main_#t~mem14#1.offset| 0) (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (v_arrayElimIndex_94 Int) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (v_arrayElimIndex_93 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= v_arrayElimIndex_93 0)) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_94) 1) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93) 0) (= (select |v_#valid_BEFORE_CALL_74| v_arrayElimIndex_94) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse0 (select |v_#valid_BEFORE_CALL_75| .cse0))) |v_#valid_BEFORE_CALL_75|) (= (select (store |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93 1) |c_ULTIMATE.start_main_#t~mem14#1.base|) 0) (not (= v_arrayElimIndex_94 0)) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse2 (select |v_#valid_BEFORE_CALL_70| .cse2)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_#t~mem14#1.base|) 0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse3 (select |v_#valid_BEFORE_CALL_69| .cse3)))) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) is different from false [2022-12-13 11:26:02,482 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_#t~mem14#1.base|))) (and (= |c_ULTIMATE.start_main_#t~mem14#1.offset| 0) (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (v_arrayElimIndex_94 Int) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (v_arrayElimIndex_93 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= v_arrayElimIndex_93 0)) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_94) 1) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93) 0) (= (select |v_#valid_BEFORE_CALL_74| v_arrayElimIndex_94) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse0 (select |v_#valid_BEFORE_CALL_75| .cse0))) |v_#valid_BEFORE_CALL_75|) (= (select (store |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93 1) |c_ULTIMATE.start_main_#t~mem14#1.base|) 0) (not (= v_arrayElimIndex_94 0)) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse2 (select |v_#valid_BEFORE_CALL_70| .cse2)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_#t~mem14#1.base|) 0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse3 (select |v_#valid_BEFORE_CALL_69| .cse3)))) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) is different from true [2022-12-13 11:26:02,609 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_main_~temp~2#1.base|))) (and (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (v_arrayElimIndex_94 Int) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (v_arrayElimIndex_93 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= v_arrayElimIndex_93 0)) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_94) 1) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93) 0) (= (select |v_#valid_BEFORE_CALL_74| v_arrayElimIndex_94) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select (store |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93 1) |c_ULTIMATE.start_main_~temp~2#1.base|) 0) (not (= v_arrayElimIndex_94 0)) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~temp~2#1.base|) 0)) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse2 (select |v_#valid_BEFORE_CALL_70| .cse2)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= .cse0 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse3 (select |v_#valid_BEFORE_CALL_69| .cse3)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from false [2022-12-13 11:26:02,615 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_main_~temp~2#1.base|))) (and (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (v_arrayElimIndex_94 Int) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (v_arrayElimIndex_93 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= v_arrayElimIndex_93 0)) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_94) 1) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93) 0) (= (select |v_#valid_BEFORE_CALL_74| v_arrayElimIndex_94) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select (store |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93 1) |c_ULTIMATE.start_main_~temp~2#1.base|) 0) (not (= v_arrayElimIndex_94 0)) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~temp~2#1.base|) 0)) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse2 (select |v_#valid_BEFORE_CALL_70| .cse2)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= .cse0 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse3 (select |v_#valid_BEFORE_CALL_69| .cse3)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from true [2022-12-13 11:26:02,718 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_main_~temp~2#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (v_arrayElimIndex_94 Int) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (v_arrayElimIndex_93 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= v_arrayElimIndex_93 0)) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_94) 1) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93) 0) (= (select |v_#valid_BEFORE_CALL_74| v_arrayElimIndex_94) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select (store |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93 1) |c_ULTIMATE.start_main_~temp~2#1.base|) 0) (not (= v_arrayElimIndex_94 0)) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~temp~2#1.base|) 0)) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse2 (select |v_#valid_BEFORE_CALL_70| .cse2)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= .cse0 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse3 (select |v_#valid_BEFORE_CALL_69| .cse3)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from false [2022-12-13 11:26:02,723 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_main_~temp~2#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (v_arrayElimIndex_94 Int) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (v_arrayElimIndex_93 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= v_arrayElimIndex_93 0)) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_94) 1) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93) 0) (= (select |v_#valid_BEFORE_CALL_74| v_arrayElimIndex_94) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select (store |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93 1) |c_ULTIMATE.start_main_~temp~2#1.base|) 0) (not (= v_arrayElimIndex_94 0)) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~temp~2#1.base|) 0)) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse2 (select |v_#valid_BEFORE_CALL_70| .cse2)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= .cse0 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse3 (select |v_#valid_BEFORE_CALL_69| .cse3)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from true [2022-12-13 11:26:02,842 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (v_arrayElimIndex_94 Int) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (v_arrayElimIndex_93 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= v_arrayElimIndex_93 0)) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_94) 1) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93) 0) (= (select (store |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_74| v_arrayElimIndex_94) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse2 (select |v_#valid_BEFORE_CALL_75| .cse2))) |v_#valid_BEFORE_CALL_75|) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (not (= v_arrayElimIndex_94 0)) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1))) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse3 (select |v_#valid_BEFORE_CALL_70| .cse3)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse0 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))))) is different from false [2022-12-13 11:26:02,848 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (v_arrayElimIndex_94 Int) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (v_arrayElimIndex_93 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= v_arrayElimIndex_93 0)) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_94) 1) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93) 0) (= (select (store |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_74| v_arrayElimIndex_94) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse2 (select |v_#valid_BEFORE_CALL_75| .cse2))) |v_#valid_BEFORE_CALL_75|) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (not (= v_arrayElimIndex_94 0)) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1))) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse3 (select |v_#valid_BEFORE_CALL_70| .cse3)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse0 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))))) is different from true [2022-12-13 11:26:03,096 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-12-13 11:26:03,158 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 46 not checked. [2022-12-13 11:26:03,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:26:05,710 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:26:05,710 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1299 treesize of output 1300 [2022-12-13 11:26:05,742 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:26:05,742 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 3221 treesize of output 3224 [2022-12-13 11:26:05,750 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 1290 treesize of output 659 [2022-12-13 11:26:34,451 WARN L233 SmtUtils]: Spent 19.63s on a formula simplification that was a NOOP. DAG size: 101 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:26:34,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582454101] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:26:34,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:26:34,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 45] total 85 [2022-12-13 11:26:34,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122001309] [2022-12-13 11:26:34,454 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:26:34,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-12-13 11:26:34,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:26:34,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-12-13 11:26:34,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=4104, Unknown=76, NotChecked=6270, Total=10712 [2022-12-13 11:26:34,456 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 85 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 75 states have internal predecessors, (123), 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-12-13 11:26:37,454 WARN L837 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_create_#t~ret5#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (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_sll_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 |c_ULTIMATE.start_sll_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |c_#valid|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2022-12-13 11:26:37,458 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_create_#t~ret5#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (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_sll_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 |c_ULTIMATE.start_sll_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |c_#valid|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2022-12-13 11:26:37,464 WARN L837 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |c_#valid|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)) is different from false [2022-12-13 11:26:37,469 WARN L859 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |c_#valid|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)) is different from true [2022-12-13 11:26:37,474 WARN L837 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (<= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |c_#valid|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |c_#valid| .cse0))))))) is different from false [2022-12-13 11:26:37,479 WARN L859 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (<= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |c_#valid|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |c_#valid| .cse0))))))) is different from true [2022-12-13 11:26:37,485 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|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|)) is different from false [2022-12-13 11:26:37,490 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|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|)) is different from true [2022-12-13 11:26:37,496 WARN L837 $PredicateComparison]: unable to prove that (and (= |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|))) (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((v_ArrVal_4451 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_4451))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|)) is different from false [2022-12-13 11:26:37,501 WARN L859 $PredicateComparison]: unable to prove that (and (= |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|))) (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((v_ArrVal_4451 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_4451))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|)) is different from true [2022-12-13 11:26:37,509 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse1 (+ |c_node_create_~temp~0#1.offset| 4)) (.cse2 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (= (select .cse0 .cse1) 0) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse2)) (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse3 (select |v_#valid_BEFORE_CALL_69| .cse3)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((v_ArrVal_4451 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_4451))) (= (select .cse4 .cse1) 0) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse2 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse4) |c_#memory_$Pointer$.base|))) is different from false [2022-12-13 11:26:37,514 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse1 (+ |c_node_create_~temp~0#1.offset| 4)) (.cse2 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (= (select .cse0 .cse1) 0) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse2)) (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse3 (select |v_#valid_BEFORE_CALL_69| .cse3)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((v_ArrVal_4451 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_4451))) (= (select .cse4 .cse1) 0) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse2 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse4) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 11:26:37,523 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse1 (+ |c_node_create_~temp~0#1.offset| 4)) (.cse2 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (= (select .cse0 .cse1) 0) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse2)) (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse3 (select |v_#valid_BEFORE_CALL_69| .cse3)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((v_ArrVal_4451 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_4451))) (= (select .cse4 .cse1) 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int| |c_node_create_~temp~0#1.base|) 0)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse2 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse4) |c_#memory_$Pointer$.base|))) is different from false [2022-12-13 11:26:37,528 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse1 (+ |c_node_create_~temp~0#1.offset| 4)) (.cse2 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (= (select .cse0 .cse1) 0) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse2)) (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse3 (select |v_#valid_BEFORE_CALL_69| .cse3)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((v_ArrVal_4451 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_4451))) (= (select .cse4 .cse1) 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int| |c_node_create_~temp~0#1.base|) 0)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse2 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse4) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 11:26:37,551 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse12 (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (.cse3 (store |c_old(#memory_$Pointer$.base)| .cse9 (select |c_#memory_$Pointer$.base| .cse9)))) (let ((.cse2 (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (.cse8 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse0 (+ |c_node_create_#res#1.offset| 4)) (.cse4 (@diff .cse3 |c_#memory_$Pointer$.base|)) (.cse5 (= |c_#memory_$Pointer$.base| .cse3)) (.cse6 (= |c_#memory_$Pointer$.offset| .cse12)) (.cse7 (@diff .cse12 |c_#memory_$Pointer$.offset|))) (and (= |c_node_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|) .cse0) 0) (or (= (select |c_old(#valid)| .cse1) 0) .cse2) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_$Pointer$.base| (store .cse3 .cse4 (select |c_#memory_$Pointer$.base| .cse4))) (<= |c_node_create_#res#1.offset| 0) (or .cse2 (<= (+ .cse1 1) |c_#StackHeapBarrier|)) (or .cse5 (<= (+ .cse4 1) |c_#StackHeapBarrier|)) (or .cse6 (<= (+ .cse7 1) |c_#StackHeapBarrier|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (or .cse8 (= (select |c_old(#valid)| .cse9) 0)) (or .cse8 (<= (+ .cse9 1) |c_#StackHeapBarrier|)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse10 (select |v_#valid_BEFORE_CALL_69| .cse10)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((v_ArrVal_4451 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_4451))) (not (= |c_node_create_#res#1.base| 0)) (= (select (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|) .cse0) 0) (= |c_#valid| (let ((.cse11 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse11 (select |c_#valid| .cse11)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (or (= (select |c_old(#valid)| .cse4) 0) .cse5) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 0) |c_node_create_#in~data#1|) (<= 0 |c_node_create_#res#1.offset|) (= |c_#memory_$Pointer$.offset| (store .cse12 .cse7 (select |c_#memory_$Pointer$.offset| .cse7))) (or .cse6 (= (select |c_old(#valid)| .cse7) 0)))))) is different from false [2022-12-13 11:26:37,561 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse12 (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (.cse3 (store |c_old(#memory_$Pointer$.base)| .cse9 (select |c_#memory_$Pointer$.base| .cse9)))) (let ((.cse2 (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (.cse8 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse0 (+ |c_node_create_#res#1.offset| 4)) (.cse4 (@diff .cse3 |c_#memory_$Pointer$.base|)) (.cse5 (= |c_#memory_$Pointer$.base| .cse3)) (.cse6 (= |c_#memory_$Pointer$.offset| .cse12)) (.cse7 (@diff .cse12 |c_#memory_$Pointer$.offset|))) (and (= |c_node_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|) .cse0) 0) (or (= (select |c_old(#valid)| .cse1) 0) .cse2) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_$Pointer$.base| (store .cse3 .cse4 (select |c_#memory_$Pointer$.base| .cse4))) (<= |c_node_create_#res#1.offset| 0) (or .cse2 (<= (+ .cse1 1) |c_#StackHeapBarrier|)) (or .cse5 (<= (+ .cse4 1) |c_#StackHeapBarrier|)) (or .cse6 (<= (+ .cse7 1) |c_#StackHeapBarrier|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (or .cse8 (= (select |c_old(#valid)| .cse9) 0)) (or .cse8 (<= (+ .cse9 1) |c_#StackHeapBarrier|)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse10 (select |v_#valid_BEFORE_CALL_69| .cse10)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((v_ArrVal_4451 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_4451))) (not (= |c_node_create_#res#1.base| 0)) (= (select (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|) .cse0) 0) (= |c_#valid| (let ((.cse11 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse11 (select |c_#valid| .cse11)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (or (= (select |c_old(#valid)| .cse4) 0) .cse5) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 0) |c_node_create_#in~data#1|) (<= 0 |c_node_create_#res#1.offset|) (= |c_#memory_$Pointer$.offset| (store .cse12 .cse7 (select |c_#memory_$Pointer$.offset| .cse7))) (or .cse6 (= (select |c_old(#valid)| .cse7) 0)))))) is different from true [2022-12-13 11:26:37,580 WARN L837 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (<= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_#t~ret5#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (not (= |c_ULTIMATE.start_sll_create_#t~ret5#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 4) 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 4) 0) (not (= |c_ULTIMATE.start_sll_create_#t~ret5#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-12-13 11:26:37,586 WARN L859 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (<= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_#t~ret5#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (not (= |c_ULTIMATE.start_sll_create_#t~ret5#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 4) 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 4) 0) (not (= |c_ULTIMATE.start_sll_create_#t~ret5#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from true [2022-12-13 11:26:37,598 WARN L837 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)) is different from false [2022-12-13 11:26:37,604 WARN L859 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)) is different from true [2022-12-13 11:26:37,621 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse4)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0)) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse2 0) (<= .cse2 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse2) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse3 (select |v_#valid_BEFORE_CALL_70| .cse3)))) (= (select |v_#valid_BEFORE_CALL_70| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_71| .cse0) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)))) is different from false [2022-12-13 11:26:37,627 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse4)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0)) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse2 0) (<= .cse2 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse2) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse3 (select |v_#valid_BEFORE_CALL_70| .cse3)))) (= (select |v_#valid_BEFORE_CALL_70| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_71| .cse0) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)))) is different from true [2022-12-13 11:26:37,645 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse4 (select .cse2 4)) (.cse6 (select .cse7 .cse3))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse1 (select .cse2 .cse3))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_70| .cse1) 1)))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (not (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse4) 1) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse5 (select |v_#valid_BEFORE_CALL_69| .cse5)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (<= .cse6 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse6) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select .cse7 4) 0)))) is different from false [2022-12-13 11:26:37,651 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse4 (select .cse2 4)) (.cse6 (select .cse7 .cse3))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse1 (select .cse2 .cse3))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_70| .cse1) 1)))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (not (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse4) 1) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse5 (select |v_#valid_BEFORE_CALL_69| .cse5)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (<= .cse6 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse6) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select .cse7 4) 0)))) is different from true [2022-12-13 11:26:37,669 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= .cse0 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse1)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse2 (select |v_#valid_BEFORE_CALL_69| .cse2)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 .cse0) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| .cse1) 1) (<= .cse0 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse3 (select |v_#valid_BEFORE_CALL_70| .cse3)))) (= (select |v_#valid_BEFORE_CALL_70| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| .cse1) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-12-13 11:26:37,675 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= .cse0 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse1)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse2 (select |v_#valid_BEFORE_CALL_69| .cse2)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 .cse0) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| .cse1) 1) (<= .cse0 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse3 (select |v_#valid_BEFORE_CALL_70| .cse3)))) (= (select |v_#valid_BEFORE_CALL_70| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| .cse1) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-12-13 11:26:37,694 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| .cse2) 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (and (<= 0 .cse0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_append_~data#1|) (= (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_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 0) (not (= .cse1 |c_ULTIMATE.start_sll_append_~head#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse1) 1) (= .cse0 0) (not (= .cse1 .cse2)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse3 (select |v_#valid_BEFORE_CALL_69| .cse3)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse4 (select |v_#valid_BEFORE_CALL_70| .cse4)))) (= (select |v_#valid_BEFORE_CALL_71| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_70| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| .cse2 v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (not (= 0 .cse2)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2022-12-13 11:26:37,700 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| .cse2) 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (and (<= 0 .cse0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_append_~data#1|) (= (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_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 0) (not (= .cse1 |c_ULTIMATE.start_sll_append_~head#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse1) 1) (= .cse0 0) (not (= .cse1 .cse2)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse3 (select |v_#valid_BEFORE_CALL_69| .cse3)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse4 (select |v_#valid_BEFORE_CALL_70| .cse4)))) (= (select |v_#valid_BEFORE_CALL_71| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_70| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| .cse2 v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (not (= 0 .cse2)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2022-12-13 11:26:37,720 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|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|)) is different from false [2022-12-13 11:26:37,726 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|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|)) is different from true [2022-12-13 11:26:37,742 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|))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|)) is different from false [2022-12-13 11:26:37,749 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|))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|)) is different from true [2022-12-13 11:26:37,767 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|))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (exists ((v_ArrVal_4465 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_4465) |c_#memory_$Pointer$.offset|)) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse2 (select |v_#valid_BEFORE_CALL_70| .cse2)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_4464 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4464) |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-12-13 11:26:37,774 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|))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (exists ((v_ArrVal_4465 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_4465) |c_#memory_$Pointer$.offset|)) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse2 (select |v_#valid_BEFORE_CALL_70| .cse2)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_4464 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4464) |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-12-13 11:26:37,791 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (exists ((v_ArrVal_4469 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4469))) (< |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|))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((v_ArrVal_4468 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_4468))) (= |c_node_create_#in~data#1| (select .cse2 |c_node_create_~temp~0#1.offset|)) (= |c_node_create_#in~data#1| (select .cse2 0)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse3 (select |v_#valid_BEFORE_CALL_70| .cse3)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (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-12-13 11:26:37,798 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (exists ((v_ArrVal_4469 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4469))) (< |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|))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((v_ArrVal_4468 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_4468))) (= |c_node_create_#in~data#1| (select .cse2 |c_node_create_~temp~0#1.offset|)) (= |c_node_create_#in~data#1| (select .cse2 0)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse3 (select |v_#valid_BEFORE_CALL_70| .cse3)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (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-12-13 11:26:37,905 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse0 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse13 (store |c_old(#memory_$Pointer$.offset)| .cse0 (select |c_#memory_$Pointer$.offset| .cse0))) (.cse2 (store |c_old(#memory_$Pointer$.base)| .cse8 (select |c_#memory_$Pointer$.base| .cse8)))) (let ((.cse1 (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (.cse7 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse3 (@diff .cse2 |c_#memory_$Pointer$.base|)) (.cse4 (= |c_#memory_$Pointer$.base| .cse2)) (.cse10 (select |c_#memory_int| |c_node_create_#res#1.base|)) (.cse5 (= |c_#memory_$Pointer$.offset| .cse13)) (.cse6 (@diff .cse13 |c_#memory_$Pointer$.offset|))) (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (or (= (select |c_old(#valid)| .cse0) 0) .cse1) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_$Pointer$.base| (store .cse2 .cse3 (select |c_#memory_$Pointer$.base| .cse3))) (<= |c_node_create_#res#1.offset| 0) (or .cse1 (<= (+ .cse0 1) |c_#StackHeapBarrier|)) (or .cse4 (<= (+ .cse3 1) |c_#StackHeapBarrier|)) (or .cse5 (<= (+ .cse6 1) |c_#StackHeapBarrier|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (or .cse7 (= (select |c_old(#valid)| .cse8) 0)) (or .cse7 (<= (+ .cse8 1) |c_#StackHeapBarrier|)) (exists ((v_ArrVal_4469 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_4469))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse9 (select |v_#valid_BEFORE_CALL_69| .cse9)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select .cse10 |c_node_create_#res#1.offset|) |c_node_create_#in~data#1|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse11 (select |v_#valid_BEFORE_CALL_70| .cse11)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_#valid| (let ((.cse12 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse12 (select |c_#valid| .cse12)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_4468 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_4468))) (or (= (select |c_old(#valid)| .cse3) 0) .cse4) (= (select .cse10 0) |c_node_create_#in~data#1|) (<= 0 |c_node_create_#res#1.offset|) (= |c_#memory_$Pointer$.offset| (store .cse13 .cse6 (select |c_#memory_$Pointer$.offset| .cse6))) (or .cse5 (= (select |c_old(#valid)| .cse6) 0)))))) is different from false [2022-12-13 11:26:37,916 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse0 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse13 (store |c_old(#memory_$Pointer$.offset)| .cse0 (select |c_#memory_$Pointer$.offset| .cse0))) (.cse2 (store |c_old(#memory_$Pointer$.base)| .cse8 (select |c_#memory_$Pointer$.base| .cse8)))) (let ((.cse1 (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (.cse7 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse3 (@diff .cse2 |c_#memory_$Pointer$.base|)) (.cse4 (= |c_#memory_$Pointer$.base| .cse2)) (.cse10 (select |c_#memory_int| |c_node_create_#res#1.base|)) (.cse5 (= |c_#memory_$Pointer$.offset| .cse13)) (.cse6 (@diff .cse13 |c_#memory_$Pointer$.offset|))) (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (or (= (select |c_old(#valid)| .cse0) 0) .cse1) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_$Pointer$.base| (store .cse2 .cse3 (select |c_#memory_$Pointer$.base| .cse3))) (<= |c_node_create_#res#1.offset| 0) (or .cse1 (<= (+ .cse0 1) |c_#StackHeapBarrier|)) (or .cse4 (<= (+ .cse3 1) |c_#StackHeapBarrier|)) (or .cse5 (<= (+ .cse6 1) |c_#StackHeapBarrier|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (or .cse7 (= (select |c_old(#valid)| .cse8) 0)) (or .cse7 (<= (+ .cse8 1) |c_#StackHeapBarrier|)) (exists ((v_ArrVal_4469 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_4469))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse9 (select |v_#valid_BEFORE_CALL_69| .cse9)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select .cse10 |c_node_create_#res#1.offset|) |c_node_create_#in~data#1|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse11 (select |v_#valid_BEFORE_CALL_70| .cse11)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_#valid| (let ((.cse12 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse12 (select |c_#valid| .cse12)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_4468 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_4468))) (or (= (select |c_old(#valid)| .cse3) 0) .cse4) (= (select .cse10 0) |c_node_create_#in~data#1|) (<= 0 |c_node_create_#res#1.offset|) (= |c_#memory_$Pointer$.offset| (store .cse13 .cse6 (select |c_#memory_$Pointer$.offset| .cse6))) (or .cse5 (= (select |c_old(#valid)| .cse6) 0)))))) is different from true [2022-12-13 11:26:37,982 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_append_#t~ret7#1.base| 2)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (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_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse2 (select |v_#valid_BEFORE_CALL_69| .cse2)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.offset| .cse3) 4) 0) (not (= .cse3 .cse4)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (not (= .cse4 |c_ULTIMATE.start_sll_append_~head#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (= (select (store |v_#valid_BEFORE_CALL_75| .cse5 1) |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse6 (select |v_#valid_BEFORE_CALL_75| .cse6))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse7) 0)))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse4 |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (not (= 0 .cse5)) (or (let ((.cse8 (select (select |c_#memory_$Pointer$.offset| .cse5) 4))) (and (<= 0 .cse8) (<= .cse8 0))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse5))))) is different from false [2022-12-13 11:26:37,989 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_append_#t~ret7#1.base| 2)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (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_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse2 (select |v_#valid_BEFORE_CALL_69| .cse2)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.offset| .cse3) 4) 0) (not (= .cse3 .cse4)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (not (= .cse4 |c_ULTIMATE.start_sll_append_~head#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (= (select (store |v_#valid_BEFORE_CALL_75| .cse5 1) |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse6 (select |v_#valid_BEFORE_CALL_75| .cse6))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse7) 0)))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse4 |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (not (= 0 .cse5)) (or (let ((.cse8 (select (select |c_#memory_$Pointer$.offset| .cse5) 4))) (and (<= 0 .cse8) (<= .cse8 0))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse5))))) is different from true [2022-12-13 11:26:38,042 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse3 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse7) 4)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (not (= .cse5 |c_ULTIMATE.start_sll_append_~new_last~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_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse6 (select |v_#valid_BEFORE_CALL_70| .cse6)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse7) 4) 0) (not (= .cse7 .cse5)) (not (= .cse5 |c_ULTIMATE.start_sll_append_~head#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (let ((.cse8 (select (select |c_#memory_$Pointer$.offset| .cse0) 4))) (and (<= 0 .cse8) (<= .cse8 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) is different from false [2022-12-13 11:26:38,048 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse3 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse7) 4)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (not (= .cse5 |c_ULTIMATE.start_sll_append_~new_last~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_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse6 (select |v_#valid_BEFORE_CALL_70| .cse6)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse7) 4) 0) (not (= .cse7 .cse5)) (not (= .cse5 |c_ULTIMATE.start_sll_append_~head#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (let ((.cse8 (select (select |c_#memory_$Pointer$.offset| .cse0) 4))) (and (<= 0 .cse8) (<= .cse8 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) is different from true [2022-12-13 11:26:38,112 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_append_#t~mem9#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse1) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse1 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse2 (select |v_#valid_BEFORE_CALL_75| .cse2))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse3) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse5 (select |v_#valid_BEFORE_CALL_69| .cse5)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse6 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse4 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_#t~mem9#1.offset| .cse6) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|) 4) 0) (not (= |c_ULTIMATE.start_sll_append_#t~mem9#1.base| .cse0)) (= |c_ULTIMATE.start_sll_append_#t~mem9#1.base| .cse1) (or (let ((.cse8 (select (select |c_#memory_$Pointer$.offset| .cse1) 4))) (and (<= 0 .cse8) (<= .cse8 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse1)) (not (= 0 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))) is different from false [2022-12-13 11:26:38,119 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_append_#t~mem9#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse1) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse1 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse2 (select |v_#valid_BEFORE_CALL_75| .cse2))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse3) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse5 (select |v_#valid_BEFORE_CALL_69| .cse5)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse6 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse4 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_#t~mem9#1.offset| .cse6) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|) 4) 0) (not (= |c_ULTIMATE.start_sll_append_#t~mem9#1.base| .cse0)) (= |c_ULTIMATE.start_sll_append_#t~mem9#1.base| .cse1) (or (let ((.cse8 (select (select |c_#memory_$Pointer$.offset| .cse1) 4))) (and (<= 0 .cse8) (<= .cse8 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse1)) (not (= 0 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))) is different from true [2022-12-13 11:26:38,171 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse8)) (.cse4 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse6 (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|))) (and (not (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse1) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse1 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse2 (select |v_#valid_BEFORE_CALL_75| .cse2))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse3) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse5 (select |v_#valid_BEFORE_CALL_69| .cse5)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse6 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse4 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse8) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (or (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| .cse1) 4))) (and (<= 0 .cse9) (<= .cse9 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse6) (not (= 0 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) is different from false [2022-12-13 11:26:38,178 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse8)) (.cse4 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse6 (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|))) (and (not (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse1) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse1 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse2 (select |v_#valid_BEFORE_CALL_75| .cse2))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse3) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse5 (select |v_#valid_BEFORE_CALL_69| .cse5)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse6 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse4 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse8) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (or (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| .cse1) 4))) (and (<= 0 .cse9) (<= .cse9 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse6) (not (= 0 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) is different from true [2022-12-13 11:26:38,206 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse8)) (.cse4 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse6 (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|))) (and (not (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse1) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse1 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse2 (select |v_#valid_BEFORE_CALL_75| .cse2))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse3) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse5 (select |v_#valid_BEFORE_CALL_69| .cse5)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse6 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse4 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse8) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_append_#t~mem11#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (or (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| .cse1) 4))) (and (<= 0 .cse9) (<= .cse9 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse6) (not (= 0 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) is different from false [2022-12-13 11:26:38,213 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse8)) (.cse4 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse6 (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|))) (and (not (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse1) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse1 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse2 (select |v_#valid_BEFORE_CALL_75| .cse2))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse3) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse5 (select |v_#valid_BEFORE_CALL_69| .cse5)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse6 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse4 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse8) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_append_#t~mem11#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (or (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| .cse1) 4))) (and (<= 0 .cse9) (<= .cse9 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse6) (not (= 0 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) is different from true [2022-12-13 11:26:38,272 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 ((.cse8 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse10 4)) (.cse9 (+ .cse5 4)) (.cse3 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse7 (select .cse8 4))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse5 0) (not (= |c_ULTIMATE.start_sll_append_#t~mem10#1.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse6 (select |v_#valid_BEFORE_CALL_70| .cse6)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= .cse2 |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) (= .cse7 0) (= (select .cse8 .cse9) |c_ULTIMATE.start_sll_append_#t~mem10#1.offset|) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select .cse10 .cse9) |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_append_#t~mem10#1.base| .cse0)) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (or (and (<= 0 .cse7) (<= .cse7 0)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (not (= |c_ULTIMATE.start_sll_append_#t~mem10#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from false [2022-12-13 11:26:38,278 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 ((.cse8 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse10 4)) (.cse9 (+ .cse5 4)) (.cse3 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse7 (select .cse8 4))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse5 0) (not (= |c_ULTIMATE.start_sll_append_#t~mem10#1.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse6 (select |v_#valid_BEFORE_CALL_70| .cse6)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= .cse2 |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) (= .cse7 0) (= (select .cse8 .cse9) |c_ULTIMATE.start_sll_append_#t~mem10#1.offset|) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select .cse10 .cse9) |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_append_#t~mem10#1.base| .cse0)) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (or (and (<= 0 .cse7) (<= .cse7 0)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (not (= |c_ULTIMATE.start_sll_append_#t~mem10#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from true [2022-12-13 11:26:38,329 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 ((.cse8 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse10 4)) (.cse3 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse9 (+ .cse5 4)) (.cse7 (select .cse8 4))) (and (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse0)) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0))) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse5 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse6 (select |v_#valid_BEFORE_CALL_70| .cse6)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= .cse7 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse8 .cse9)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse10 .cse9) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (or (and (<= 0 .cse7) (<= .cse7 0)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))))) is different from false [2022-12-13 11:26:38,336 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 ((.cse8 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse10 4)) (.cse3 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse9 (+ .cse5 4)) (.cse7 (select .cse8 4))) (and (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse0)) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0))) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse5 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse6 (select |v_#valid_BEFORE_CALL_70| .cse6)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= .cse7 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse8 .cse9)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse10 .cse9) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (or (and (<= 0 .cse7) (<= .cse7 0)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))))) is different from true [2022-12-13 11:26:38,397 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 ((.cse9 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse11 4)) (.cse3 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse10 (+ .cse6 4)) (.cse8 (select .cse9 4))) (and (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse0)) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0))) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_sll_append_#t~mem11#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse5)) (= .cse6 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= .cse8 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse9 .cse10)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse5) |c_ULTIMATE.start_sll_append_#t~mem11#1.base|) (= (select .cse11 .cse10) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (or (and (<= 0 .cse8) (<= .cse8 0)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))))) is different from false [2022-12-13 11:26:38,405 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse11 4)) (.cse3 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse10 (+ .cse6 4)) (.cse8 (select .cse9 4))) (and (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse0)) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0))) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_sll_append_#t~mem11#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse5)) (= .cse6 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= .cse8 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse9 .cse10)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse5) |c_ULTIMATE.start_sll_append_#t~mem11#1.base|) (= (select .cse11 .cse10) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (or (and (<= 0 .cse8) (<= .cse8 0)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))))) is different from true [2022-12-13 11:26:38,494 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 ((.cse6 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse9 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse13 4)) (.cse3 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse10 (+ .cse5 4)) (.cse8 (select .cse9 4)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse12 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse6))) (and (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse0)) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0))) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse5 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse6) 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= .cse8 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse9 .cse10)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 .cse12)) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse13 .cse10) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (or (and (<= 0 .cse8) (<= .cse8 0)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 0)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| .cse12))))) is different from false [2022-12-13 11:26:38,501 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 ((.cse6 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse9 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse13 4)) (.cse3 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse10 (+ .cse5 4)) (.cse8 (select .cse9 4)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse12 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse6))) (and (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse0)) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0))) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse5 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse6) 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= .cse8 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse9 .cse10)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 .cse12)) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse13 .cse10) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (or (and (<= 0 .cse8) (<= .cse8 0)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 0)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| .cse12))))) is different from true [2022-12-13 11:26:38,574 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| .cse2) 4)) (.cse9 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse7 (select |c_#memory_$Pointer$.base| .cse9)) (.cse6 (+ .cse0 4))) (let ((.cse1 (select .cse7 .cse6))) (let ((.cse5 (select |c_#memory_$Pointer$.offset| .cse9)) (.cse3 (+ 2 .cse1))) (and (or (and (<= 0 .cse0) (<= .cse0 0)) (= .cse1 .cse2)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select .cse5 .cse6) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| (select .cse7 4)) (select .cse5 4))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse8 (select |v_#valid_BEFORE_CALL_70| .cse8)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= .cse0 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse9 .cse1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 0))) (not (= 0 .cse2)) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_75| .cse2 1) .cse1) 0) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 0) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse10 (select |v_#valid_BEFORE_CALL_75| .cse10))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse9) 0))))))))) is different from false [2022-12-13 11:26:38,581 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| .cse2) 4)) (.cse9 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse7 (select |c_#memory_$Pointer$.base| .cse9)) (.cse6 (+ .cse0 4))) (let ((.cse1 (select .cse7 .cse6))) (let ((.cse5 (select |c_#memory_$Pointer$.offset| .cse9)) (.cse3 (+ 2 .cse1))) (and (or (and (<= 0 .cse0) (<= .cse0 0)) (= .cse1 .cse2)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select .cse5 .cse6) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| (select .cse7 4)) (select .cse5 4))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse8 (select |v_#valid_BEFORE_CALL_70| .cse8)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= .cse0 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse9 .cse1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 0))) (not (= 0 .cse2)) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_75| .cse2 1) .cse1) 0) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 0) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse10 (select |v_#valid_BEFORE_CALL_75| .cse10))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse9) 0))))))))) is different from true [2022-12-13 11:26:38,749 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse9 (+ .cse1 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse4) .cse9))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (+ 2 .cse6))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= (select |v_#valid_BEFORE_CALL_75| .cse4) 1) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse1 0) (= .cse5 |c_ULTIMATE.start_main_#t~mem13#1.offset|) (= .cse5 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse6) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse7 (select |v_#valid_BEFORE_CALL_69| .cse7)))) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse8 (select |v_#valid_BEFORE_CALL_75| .cse8))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse4) .cse9) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse6) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1)))))))) (= |c_ULTIMATE.start_main_#t~mem13#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem13#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem13#1.base|) 4))) (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse10) 4)) (select (select |c_#memory_$Pointer$.offset| .cse10) 4))))) is different from false [2022-12-13 11:26:38,756 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse9 (+ .cse1 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse4) .cse9))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (+ 2 .cse6))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= (select |v_#valid_BEFORE_CALL_75| .cse4) 1) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse1 0) (= .cse5 |c_ULTIMATE.start_main_#t~mem13#1.offset|) (= .cse5 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse6) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse7 (select |v_#valid_BEFORE_CALL_69| .cse7)))) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse8 (select |v_#valid_BEFORE_CALL_75| .cse8))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse4) .cse9) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse6) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1)))))))) (= |c_ULTIMATE.start_main_#t~mem13#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem13#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem13#1.base|) 4))) (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse10) 4)) (select (select |c_#memory_$Pointer$.offset| .cse10) 4))))) is different from true [2022-12-13 11:26:38,797 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse1))) (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (select (select |c_#memory_$Pointer$.offset| .cse0) 4)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse11 (+ .cse4 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse6) .cse11))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse5 (+ 2 .cse8))) (and (= .cse2 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= |v_#valid_BEFORE_CALL_70| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse3 (select |v_#valid_BEFORE_CALL_70| .cse3)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse4) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 0) (not (= .cse2 0)) (= (select |v_#valid_BEFORE_CALL_75| .cse6) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse7) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse5 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse4 0) (= .cse7 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (<= .cse5 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse9 (select |v_#valid_BEFORE_CALL_69| .cse9)))) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse10 (select |v_#valid_BEFORE_CALL_75| .cse10))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse6) .cse11) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse2 1) .cse8) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1)))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse1) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from false [2022-12-13 11:26:38,805 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse1))) (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (select (select |c_#memory_$Pointer$.offset| .cse0) 4)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse11 (+ .cse4 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse6) .cse11))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse5 (+ 2 .cse8))) (and (= .cse2 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= |v_#valid_BEFORE_CALL_70| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse3 (select |v_#valid_BEFORE_CALL_70| .cse3)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse4) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 0) (not (= .cse2 0)) (= (select |v_#valid_BEFORE_CALL_75| .cse6) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse7) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse5 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse4 0) (= .cse7 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (<= .cse5 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse9 (select |v_#valid_BEFORE_CALL_69| .cse9)))) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse10 (select |v_#valid_BEFORE_CALL_75| .cse10))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse6) .cse11) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse2 1) .cse8) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1)))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse1) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from true [2022-12-13 11:26:38,877 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_#t~mem14#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse10 (select |c_#memory_$Pointer$.offset| .cse3))) (let ((.cse1 (select .cse10 4)) (.cse6 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse4 (select .cse6 4)) (.cse12 (+ .cse1 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse4) .cse12))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (+ 2 .cse8)) (.cse7 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= (select |v_#valid_BEFORE_CALL_75| .cse4) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select .cse6 .cse7) |c_ULTIMATE.start_main_#t~mem14#1.base|) (<= .cse1 0) (= .cse5 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse9 (select |v_#valid_BEFORE_CALL_69| .cse9)))) (= |c_ULTIMATE.start_main_#t~mem14#1.offset| (select .cse10 .cse7)) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse11 (select |v_#valid_BEFORE_CALL_75| .cse11))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse4) .cse12) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse8) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base|) 4)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem14#1.base|) 4)))) is different from false [2022-12-13 11:26:38,884 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_#t~mem14#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse10 (select |c_#memory_$Pointer$.offset| .cse3))) (let ((.cse1 (select .cse10 4)) (.cse6 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse4 (select .cse6 4)) (.cse12 (+ .cse1 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse4) .cse12))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (+ 2 .cse8)) (.cse7 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= (select |v_#valid_BEFORE_CALL_75| .cse4) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select .cse6 .cse7) |c_ULTIMATE.start_main_#t~mem14#1.base|) (<= .cse1 0) (= .cse5 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse9 (select |v_#valid_BEFORE_CALL_69| .cse9)))) (= |c_ULTIMATE.start_main_#t~mem14#1.offset| (select .cse10 .cse7)) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse11 (select |v_#valid_BEFORE_CALL_75| .cse11))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse4) .cse12) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse8) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base|) 4)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem14#1.base|) 4)))) is different from true [2022-12-13 11:26:38,964 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| .cse3))) (let ((.cse1 (select .cse6 4)) (.cse11 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse4 (select .cse11 4)) (.cse12 (+ .cse1 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse4) .cse12))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (+ 2 .cse8)) (.cse7 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= (select |v_#valid_BEFORE_CALL_75| .cse4) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse1 0) (= .cse5 0) (= |c_ULTIMATE.start_main_~temp~2#1.offset| (select .cse6 .cse7)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse9 (select |v_#valid_BEFORE_CALL_69| .cse9)))) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse10 (select |v_#valid_BEFORE_CALL_75| .cse10))) |v_#valid_BEFORE_CALL_75|) (= (select .cse11 .cse7) |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse4) .cse12) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse8) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))))))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2022-12-13 11:26:38,971 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| .cse3))) (let ((.cse1 (select .cse6 4)) (.cse11 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse4 (select .cse11 4)) (.cse12 (+ .cse1 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse4) .cse12))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (+ 2 .cse8)) (.cse7 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= (select |v_#valid_BEFORE_CALL_75| .cse4) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse1 0) (= .cse5 0) (= |c_ULTIMATE.start_main_~temp~2#1.offset| (select .cse6 .cse7)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse9 (select |v_#valid_BEFORE_CALL_69| .cse9)))) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse10 (select |v_#valid_BEFORE_CALL_75| .cse10))) |v_#valid_BEFORE_CALL_75|) (= (select .cse11 .cse7) |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse4) .cse12) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse8) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))))))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2022-12-13 11:26:39,063 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select |c_#memory_$Pointer$.offset| .cse3))) (let ((.cse1 (select .cse4 4)) (.cse7 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse6 (select .cse7 4)) (.cse12 (+ .cse1 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| .cse6) .cse12)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (+ .cse8 4)) (.cse2 (+ 2 .cse9))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= |c_ULTIMATE.start_main_~temp~2#1.offset| (select .cse4 .cse5)) (= (select |v_#valid_BEFORE_CALL_75| .cse6) 1) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse1 0) (= (select .cse7 .cse5) |c_ULTIMATE.start_main_~temp~2#1.base|) (= .cse8 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse9) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse10 (select |v_#valid_BEFORE_CALL_69| .cse10)))) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse11 (select |v_#valid_BEFORE_CALL_75| .cse11))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse6) .cse12) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse9) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))))))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2022-12-13 11:26:39,070 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select |c_#memory_$Pointer$.offset| .cse3))) (let ((.cse1 (select .cse4 4)) (.cse7 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse6 (select .cse7 4)) (.cse12 (+ .cse1 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| .cse6) .cse12)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (+ .cse8 4)) (.cse2 (+ 2 .cse9))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= |c_ULTIMATE.start_main_~temp~2#1.offset| (select .cse4 .cse5)) (= (select |v_#valid_BEFORE_CALL_75| .cse6) 1) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse1 0) (= (select .cse7 .cse5) |c_ULTIMATE.start_main_~temp~2#1.base|) (= .cse8 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse9) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse10 (select |v_#valid_BEFORE_CALL_69| .cse10)))) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse11 (select |v_#valid_BEFORE_CALL_75| .cse11))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse6) .cse12) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse9) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))))))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2022-12-13 11:26:39,144 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse13 (select |c_#memory_$Pointer$.offset| .cse4))) (let ((.cse2 (select .cse13 4)) (.cse5 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse7 (select .cse5 4)) (.cse12 (+ .cse2 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse9 (select (select |c_#memory_$Pointer$.base| .cse7) .cse12))) (let ((.cse3 (+ 2 .cse9)) (.cse6 (+ .cse8 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse2) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse4) 0) (not (= .cse4 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse5 .cse6)) (= (select |v_#valid_BEFORE_CALL_75| .cse7) 1) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse2 0) (= .cse8 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse9) 0)) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse10 (select |v_#valid_BEFORE_CALL_69| .cse10)))) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse11 (select |v_#valid_BEFORE_CALL_75| .cse11))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse7) .cse12) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse4 1) .cse9) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1) (= (select .cse13 .cse6) |c_ULTIMATE.start_main_~ptr~0#1.offset|))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2022-12-13 11:26:39,151 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse13 (select |c_#memory_$Pointer$.offset| .cse4))) (let ((.cse2 (select .cse13 4)) (.cse5 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse7 (select .cse5 4)) (.cse12 (+ .cse2 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse9 (select (select |c_#memory_$Pointer$.base| .cse7) .cse12))) (let ((.cse3 (+ 2 .cse9)) (.cse6 (+ .cse8 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse2) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse4) 0) (not (= .cse4 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse5 .cse6)) (= (select |v_#valid_BEFORE_CALL_75| .cse7) 1) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse2 0) (= .cse8 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse9) 0)) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse10 (select |v_#valid_BEFORE_CALL_69| .cse10)))) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse11 (select |v_#valid_BEFORE_CALL_75| .cse11))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse7) .cse12) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse4 1) .cse9) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1) (= (select .cse13 .cse6) |c_ULTIMATE.start_main_~ptr~0#1.offset|))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2022-12-13 11:26:39,189 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0))) (and .cse0 (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse1)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse1)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse14 (select |c_#memory_$Pointer$.offset| .cse5))) (let ((.cse3 (select .cse14 4)) (.cse6 (select |c_#memory_$Pointer$.base| .cse5))) (let ((.cse8 (select .cse6 4)) (.cse13 (+ .cse3 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse10 (select (select |c_#memory_$Pointer$.base| .cse8) .cse13))) (let ((.cse4 (+ 2 .cse10)) (.cse7 (+ .cse9 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse2 (select |v_#valid_BEFORE_CALL_70| .cse2)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse3) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse5) 0) (not (= .cse5 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse6 .cse7)) (= (select |v_#valid_BEFORE_CALL_75| .cse8) 1) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse4 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse3 0) (= .cse9 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse10) 0)) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse11 (select |v_#valid_BEFORE_CALL_69| .cse11)))) (= (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse12 (select |v_#valid_BEFORE_CALL_75| .cse12))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse8) .cse13) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse5 1) .cse10) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1) (= (select .cse14 .cse7) |c_ULTIMATE.start_main_~ptr~0#1.offset|))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (not .cse0)))) is different from false [2022-12-13 11:26:39,196 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0))) (and .cse0 (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse1)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse1)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse14 (select |c_#memory_$Pointer$.offset| .cse5))) (let ((.cse3 (select .cse14 4)) (.cse6 (select |c_#memory_$Pointer$.base| .cse5))) (let ((.cse8 (select .cse6 4)) (.cse13 (+ .cse3 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse10 (select (select |c_#memory_$Pointer$.base| .cse8) .cse13))) (let ((.cse4 (+ 2 .cse10)) (.cse7 (+ .cse9 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse2 (select |v_#valid_BEFORE_CALL_70| .cse2)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse3) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse5) 0) (not (= .cse5 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse6 .cse7)) (= (select |v_#valid_BEFORE_CALL_75| .cse8) 1) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse4 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse3 0) (= .cse9 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse10) 0)) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse11 (select |v_#valid_BEFORE_CALL_69| .cse11)))) (= (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse12 (select |v_#valid_BEFORE_CALL_75| .cse12))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse8) .cse13) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse5 1) .cse10) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1) (= (select .cse14 .cse7) |c_ULTIMATE.start_main_~ptr~0#1.offset|))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (not .cse0)))) is different from true [2022-12-13 11:26:39,241 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_#t~mem14#1.base|)) (.cse1 (+ 2 |c_ULTIMATE.start_main_#t~mem14#1.base|))) (and (= |c_ULTIMATE.start_main_#t~mem14#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (v_arrayElimIndex_94 Int) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (v_arrayElimIndex_93 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= v_arrayElimIndex_93 0)) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_94) 1) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93) 0) (= (select |v_#valid_BEFORE_CALL_74| v_arrayElimIndex_94) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse0 (select |v_#valid_BEFORE_CALL_75| .cse0))) |v_#valid_BEFORE_CALL_75|) (= (select (store |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93 1) |c_ULTIMATE.start_main_#t~mem14#1.base|) 0) (not (= v_arrayElimIndex_94 0)) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse2 (select |v_#valid_BEFORE_CALL_70| .cse2)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 |c_ULTIMATE.start_main_#t~mem14#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) is different from false [2022-12-13 11:26:39,247 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_#t~mem14#1.base|)) (.cse1 (+ 2 |c_ULTIMATE.start_main_#t~mem14#1.base|))) (and (= |c_ULTIMATE.start_main_#t~mem14#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (v_arrayElimIndex_94 Int) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (v_arrayElimIndex_93 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= v_arrayElimIndex_93 0)) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_94) 1) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93) 0) (= (select |v_#valid_BEFORE_CALL_74| v_arrayElimIndex_94) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse0 (select |v_#valid_BEFORE_CALL_75| .cse0))) |v_#valid_BEFORE_CALL_75|) (= (select (store |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93 1) |c_ULTIMATE.start_main_#t~mem14#1.base|) 0) (not (= v_arrayElimIndex_94 0)) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse2 (select |v_#valid_BEFORE_CALL_70| .cse2)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 |c_ULTIMATE.start_main_#t~mem14#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) is different from true [2022-12-13 11:26:39,283 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~temp~2#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_main_~temp~2#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (v_arrayElimIndex_94 Int) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (v_arrayElimIndex_93 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= v_arrayElimIndex_93 0)) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_94) 1) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93) 0) (= (select |v_#valid_BEFORE_CALL_74| v_arrayElimIndex_94) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select (store |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93 1) |c_ULTIMATE.start_main_~temp~2#1.base|) 0) (not (= v_arrayElimIndex_94 0)) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 0)) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse3 (select |v_#valid_BEFORE_CALL_70| .cse3)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= .cse0 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 |c_ULTIMATE.start_main_~temp~2#1.offset|)) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from false [2022-12-13 11:26:39,289 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~temp~2#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_main_~temp~2#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (v_arrayElimIndex_94 Int) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (v_arrayElimIndex_93 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= v_arrayElimIndex_93 0)) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_94) 1) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93) 0) (= (select |v_#valid_BEFORE_CALL_74| v_arrayElimIndex_94) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select (store |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93 1) |c_ULTIMATE.start_main_~temp~2#1.base|) 0) (not (= v_arrayElimIndex_94 0)) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 0)) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse3 (select |v_#valid_BEFORE_CALL_70| .cse3)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= .cse0 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 |c_ULTIMATE.start_main_~temp~2#1.offset|)) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from true [2022-12-13 11:26:39,326 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~temp~2#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_main_~temp~2#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (v_arrayElimIndex_94 Int) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (v_arrayElimIndex_93 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= v_arrayElimIndex_93 0)) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_94) 1) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93) 0) (= (select |v_#valid_BEFORE_CALL_74| v_arrayElimIndex_94) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select (store |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93 1) |c_ULTIMATE.start_main_~temp~2#1.base|) 0) (not (= v_arrayElimIndex_94 0)) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 0)) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse3 (select |v_#valid_BEFORE_CALL_70| .cse3)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= .cse0 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 |c_ULTIMATE.start_main_~temp~2#1.offset|)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from false [2022-12-13 11:26:39,332 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~temp~2#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_main_~temp~2#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (v_arrayElimIndex_94 Int) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (v_arrayElimIndex_93 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= v_arrayElimIndex_93 0)) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_94) 1) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93) 0) (= (select |v_#valid_BEFORE_CALL_74| v_arrayElimIndex_94) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select (store |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93 1) |c_ULTIMATE.start_main_~temp~2#1.base|) 0) (not (= v_arrayElimIndex_94 0)) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 0)) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse3 (select |v_#valid_BEFORE_CALL_70| .cse3)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= .cse0 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 |c_ULTIMATE.start_main_~temp~2#1.offset|)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from true [2022-12-13 11:26:39,414 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (v_arrayElimIndex_94 Int) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (v_arrayElimIndex_93 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= v_arrayElimIndex_93 0)) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_94) 1) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93) 0) (= (select (store |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_74| v_arrayElimIndex_94) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse3 (select |v_#valid_BEFORE_CALL_75| .cse3))) |v_#valid_BEFORE_CALL_75|) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (not (= v_arrayElimIndex_94 0)) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1))) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse4 (select |v_#valid_BEFORE_CALL_70| .cse4)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse0 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))))) is different from false [2022-12-13 11:26:39,421 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (v_arrayElimIndex_94 Int) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (v_arrayElimIndex_93 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= v_arrayElimIndex_93 0)) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_94) 1) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93) 0) (= (select (store |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_74| v_arrayElimIndex_94) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse3 (select |v_#valid_BEFORE_CALL_75| .cse3))) |v_#valid_BEFORE_CALL_75|) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (not (= v_arrayElimIndex_94 0)) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1))) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse4 (select |v_#valid_BEFORE_CALL_70| .cse4)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse0 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))))) is different from true [2022-12-13 11:26:39,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:26:39,979 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2022-12-13 11:26:39,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-12-13 11:26:39,980 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 75 states have internal predecessors, (123), 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 70 [2022-12-13 11:26:39,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:26:39,980 INFO L225 Difference]: With dead ends: 96 [2022-12-13 11:26:39,980 INFO L226 Difference]: Without dead ends: 96 [2022-12-13 11:26:39,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 146 ConstructedPredicates, 78 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 37.6s TimeCoverageRelationStatistics Valid=380, Invalid=4606, Unknown=156, NotChecked=16614, Total=21756 [2022-12-13 11:26:39,982 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 9 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 2153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1577 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:26:39,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 836 Invalid, 2153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 572 Invalid, 0 Unknown, 1577 Unchecked, 1.1s Time] [2022-12-13 11:26:39,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-12-13 11:26:39,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-12-13 11:26:39,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.15) internal successors, (92), 89 states have internal predecessors, (92), 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-12-13 11:26:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2022-12-13 11:26:39,984 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 70 [2022-12-13 11:26:39,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:26:39,984 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2022-12-13 11:26:39,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 75 states have internal predecessors, (123), 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-12-13 11:26:39,985 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2022-12-13 11:26:39,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-13 11:26:39,985 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:26:39,985 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-12-13 11:26:39,992 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-13 11:26:40,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-13 11:26:40,186 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:26:40,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:26:40,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1546766981, now seen corresponding path program 3 times [2022-12-13 11:26:40,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:26:40,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247418695] [2022-12-13 11:26:40,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:26:40,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:26:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:26:44,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:26:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:26:45,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:26:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:26:45,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:26:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:26:46,847 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 44 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 11:26:46,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:26:46,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247418695] [2022-12-13 11:26:46,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247418695] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:26:46,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219156713] [2022-12-13 11:26:46,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 11:26:46,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:26:46,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:26:46,849 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:26:46,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 11:26:47,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 11:26:47,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:26:47,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 200 conjunts are in the unsatisfiable core [2022-12-13 11:26:47,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:26:47,419 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-12-13 11:26:47,595 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-12-13 11:26:47,991 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:26:47,992 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-12-13 11:26:49,026 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-12-13 11:26:49,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2022-12-13 11:26:49,417 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-12-13 11:26:49,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:26:50,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:26:50,500 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:26:50,500 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 86 treesize of output 35 [2022-12-13 11:26:50,517 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 11:26:50,517 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 15 [2022-12-13 11:26:51,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:26:51,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:26:51,762 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:26:51,781 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-12-13 11:26:51,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 69 [2022-12-13 11:26:51,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:26:51,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:26:51,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:26:51,799 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-13 11:26:51,799 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 94 [2022-12-13 11:26:51,837 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-12-13 11:26:51,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-12-13 11:26:55,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:26:55,044 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:26:55,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:26:55,097 INFO L321 Elim1Store]: treesize reduction 98, result has 22.2 percent of original size [2022-12-13 11:26:55,098 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 238 treesize of output 130 [2022-12-13 11:26:55,155 INFO L321 Elim1Store]: treesize reduction 156, result has 14.3 percent of original size [2022-12-13 11:26:55,155 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 8 new quantified variables, introduced 9 case distinctions, treesize of input 379 treesize of output 220 [2022-12-13 11:26:59,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:26:59,768 INFO L321 Elim1Store]: treesize reduction 132, result has 7.7 percent of original size [2022-12-13 11:26:59,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 315 treesize of output 116 [2022-12-13 11:26:59,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:26:59,808 INFO L321 Elim1Store]: treesize reduction 22, result has 24.1 percent of original size [2022-12-13 11:26:59,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 38 [2022-12-13 11:26:59,845 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 17 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 11:26:59,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:27:09,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219156713] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:27:09,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:27:09,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 46] total 82 [2022-12-13 11:27:09,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786220816] [2022-12-13 11:27:09,966 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:27:09,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-12-13 11:27:09,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:27:09,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-12-13 11:27:09,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=10378, Unknown=0, NotChecked=0, Total=10712 [2022-12-13 11:27:09,968 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand has 82 states, 80 states have (on average 1.525) internal successors, (122), 73 states have internal predecessors, (122), 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-12-13 11:27:33,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:27:33,012 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2022-12-13 11:27:33,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-13 11:27:33,013 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 80 states have (on average 1.525) internal successors, (122), 73 states have internal predecessors, (122), 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 71 [2022-12-13 11:27:33,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:27:33,014 INFO L225 Difference]: With dead ends: 101 [2022-12-13 11:27:33,014 INFO L226 Difference]: Without dead ends: 101 [2022-12-13 11:27:33,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4200 ImplicationChecksByTransitivity, 40.9s TimeCoverageRelationStatistics Valid=1215, Invalid=18245, Unknown=0, NotChecked=0, Total=19460 [2022-12-13 11:27:33,016 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 818 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 2295 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 2327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-12-13 11:27:33,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 856 Invalid, 2327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2295 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-12-13 11:27:33,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-12-13 11:27:33,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2022-12-13 11:27:33,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 82 states have internal predecessors, (83), 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-12-13 11:27:33,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2022-12-13 11:27:33,020 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 71 [2022-12-13 11:27:33,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:27:33,020 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2022-12-13 11:27:33,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 80 states have (on average 1.525) internal successors, (122), 73 states have internal predecessors, (122), 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-12-13 11:27:33,020 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2022-12-13 11:27:33,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-13 11:27:33,021 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:27:33,021 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-12-13 11:27:33,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-13 11:27:33,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:27:33,222 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:27:33,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:27:33,223 INFO L85 PathProgramCache]: Analyzing trace with hash -705137454, now seen corresponding path program 1 times [2022-12-13 11:27:33,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:27:33,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125996383] [2022-12-13 11:27:33,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:27:33,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:27:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:33,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:27:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:33,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:27:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:33,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:27:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 11:27:33,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:27:33,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125996383] [2022-12-13 11:27:33,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125996383] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:27:33,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837949106] [2022-12-13 11:27:33,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:27:33,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:27:33,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:27:33,548 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:27:33,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 11:27:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:33,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 11:27:33,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:27:34,290 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-13 11:27:34,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:27:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-13 11:27:34,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837949106] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:27:34,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:27:34,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2022-12-13 11:27:34,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292601141] [2022-12-13 11:27:34,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:27:34,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 11:27:34,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:27:34,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 11:27:34,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-13 11:27:34,708 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 12 states have internal predecessors, (74), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 11:27:34,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:27:34,896 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2022-12-13 11:27:34,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 11:27:34,896 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 12 states have internal predecessors, (74), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 72 [2022-12-13 11:27:34,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:27:34,897 INFO L225 Difference]: With dead ends: 87 [2022-12-13 11:27:34,897 INFO L226 Difference]: Without dead ends: 87 [2022-12-13 11:27:34,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-13 11:27:34,897 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 51 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:27:34,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 389 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 11:27:34,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-12-13 11:27:34,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-12-13 11:27:34,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 75 states have (on average 1.08) internal successors, (81), 80 states have internal predecessors, (81), 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-12-13 11:27:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2022-12-13 11:27:34,899 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 72 [2022-12-13 11:27:34,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:27:34,899 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2022-12-13 11:27:34,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 12 states have internal predecessors, (74), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 11:27:34,899 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2022-12-13 11:27:34,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-13 11:27:34,900 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:27:34,900 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-12-13 11:27:34,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-13 11:27:35,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:27:35,101 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:27:35,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:27:35,101 INFO L85 PathProgramCache]: Analyzing trace with hash -63732908, now seen corresponding path program 1 times [2022-12-13 11:27:35,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:27:35,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230691583] [2022-12-13 11:27:35,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:27:35,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:27:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:35,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:27:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:35,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:27:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:35,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:27:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:35,294 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-13 11:27:35,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:27:35,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230691583] [2022-12-13 11:27:35,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230691583] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:27:35,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742320466] [2022-12-13 11:27:35,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:27:35,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:27:35,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:27:35,295 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:27:35,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 11:27:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:35,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 11:27:35,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:27:35,612 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-12-13 11:27:35,625 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-12-13 11:27:35,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:27:35,707 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-13 11:27:35,707 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 16 treesize of output 15 [2022-12-13 11:27:35,727 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-12-13 11:27:35,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742320466] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:27:35,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:27:35,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2022-12-13 11:27:35,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226950315] [2022-12-13 11:27:35,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:27:35,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 11:27:35,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:27:35,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 11:27:35,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 11:27:35,728 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 11:27:36,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:27:36,073 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2022-12-13 11:27:36,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 11:27:36,073 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 75 [2022-12-13 11:27:36,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:27:36,074 INFO L225 Difference]: With dead ends: 96 [2022-12-13 11:27:36,074 INFO L226 Difference]: Without dead ends: 96 [2022-12-13 11:27:36,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:27:36,075 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 35 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:27:36,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 216 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 11:27:36,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-12-13 11:27:36,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2022-12-13 11:27:36,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.0909090909090908) internal successors, (84), 81 states have internal predecessors, (84), 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-12-13 11:27:36,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2022-12-13 11:27:36,076 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 75 [2022-12-13 11:27:36,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:27:36,077 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2022-12-13 11:27:36,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 11:27:36,077 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2022-12-13 11:27:36,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-13 11:27:36,077 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:27:36,077 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-12-13 11:27:36,084 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-13 11:27:36,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-13 11:27:36,278 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:27:36,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:27:36,278 INFO L85 PathProgramCache]: Analyzing trace with hash -63732907, now seen corresponding path program 1 times [2022-12-13 11:27:36,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:27:36,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61192286] [2022-12-13 11:27:36,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:27:36,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:27:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:36,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:27:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:36,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:27:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:36,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:27:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:36,604 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-13 11:27:36,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:27:36,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61192286] [2022-12-13 11:27:36,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61192286] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:27:36,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444339077] [2022-12-13 11:27:36,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:27:36,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:27:36,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:27:36,606 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:27:36,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-13 11:27:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:36,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 11:27:36,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:27:36,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-12-13 11:27:36,987 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-12-13 11:27:37,009 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-13 11:27:37,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:27:37,341 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:27:37,341 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 34 treesize of output 38 [2022-12-13 11:27:37,552 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-13 11:27:37,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444339077] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:27:37,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:27:37,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-12-13 11:27:37,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114907468] [2022-12-13 11:27:37,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:27:37,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 11:27:37,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:27:37,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 11:27:37,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-12-13 11:27:37,554 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand has 16 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 11:27:38,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:27:38,250 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2022-12-13 11:27:38,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 11:27:38,251 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 75 [2022-12-13 11:27:38,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:27:38,251 INFO L225 Difference]: With dead ends: 94 [2022-12-13 11:27:38,251 INFO L226 Difference]: Without dead ends: 94 [2022-12-13 11:27:38,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2022-12-13 11:27:38,252 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 80 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 11:27:38,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 301 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 11:27:38,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-12-13 11:27:38,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2022-12-13 11:27:38,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.077922077922078) internal successors, (83), 81 states have internal predecessors, (83), 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-12-13 11:27:38,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2022-12-13 11:27:38,254 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 75 [2022-12-13 11:27:38,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:27:38,254 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2022-12-13 11:27:38,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 11:27:38,254 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2022-12-13 11:27:38,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-13 11:27:38,254 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:27:38,255 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-12-13 11:27:38,260 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-13 11:27:38,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-13 11:27:38,456 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:27:38,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:27:38,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1975721568, now seen corresponding path program 1 times [2022-12-13 11:27:38,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:27:38,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999550759] [2022-12-13 11:27:38,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:27:38,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:27:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:38,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:27:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:38,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:27:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:38,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:27:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:38,733 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-13 11:27:38,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:27:38,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999550759] [2022-12-13 11:27:38,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999550759] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:27:38,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651175539] [2022-12-13 11:27:38,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:27:38,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:27:38,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:27:38,735 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:27:38,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-13 11:27:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:38,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 11:27:38,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:27:39,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-12-13 11:27:39,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-12-13 11:27:39,152 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-13 11:27:39,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:27:39,422 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-13 11:27:39,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651175539] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 11:27:39,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:27:39,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 10 [2022-12-13 11:27:39,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934572884] [2022-12-13 11:27:39,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:27:39,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:27:39,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:27:39,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:27:39,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:27:39,424 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 11:27:39,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:27:39,607 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2022-12-13 11:27:39,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:27:39,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2022-12-13 11:27:39,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:27:39,609 INFO L225 Difference]: With dead ends: 88 [2022-12-13 11:27:39,609 INFO L226 Difference]: Without dead ends: 88 [2022-12-13 11:27:39,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-13 11:27:39,610 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 50 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:27:39,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 167 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:27:39,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-12-13 11:27:39,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-12-13 11:27:39,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 81 states have internal predecessors, (82), 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-12-13 11:27:39,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2022-12-13 11:27:39,612 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 76 [2022-12-13 11:27:39,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:27:39,613 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2022-12-13 11:27:39,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 11:27:39,613 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2022-12-13 11:27:39,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-13 11:27:39,613 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:27:39,613 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-12-13 11:27:39,619 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-12-13 11:27:39,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-13 11:27:39,814 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:27:39,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:27:39,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1117779724, now seen corresponding path program 1 times [2022-12-13 11:27:39,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:27:39,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655472304] [2022-12-13 11:27:39,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:27:39,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:27:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:40,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:27:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:40,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:27:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:40,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:27:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:40,971 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-13 11:27:40,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:27:40,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655472304] [2022-12-13 11:27:40,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655472304] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:27:40,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201749692] [2022-12-13 11:27:40,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:27:40,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:27:40,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:27:40,973 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:27:40,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-13 11:27:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:41,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-13 11:27:41,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:27:41,771 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-12-13 11:27:41,776 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 8 treesize of output 4 [2022-12-13 11:27:41,934 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5514 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5514))) (exists ((v_ArrVal_5513 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5513) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 11:27:41,950 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_5515 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_5515))) (exists ((v_ArrVal_5516 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_5516) |c_#memory_$Pointer$.offset|)))) is different from true [2022-12-13 11:27:41,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:27:41,986 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 15 treesize of output 17 [2022-12-13 11:27:41,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:27:41,996 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-12-13 11:27:42,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:27:42,131 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 18 treesize of output 22 [2022-12-13 11:27:42,357 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-12-13 11:27:42,357 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 20 [2022-12-13 11:27:42,501 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-12-13 11:27:42,515 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 4 not checked. [2022-12-13 11:27:42,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:27:43,160 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_node_create_~temp~0#1.base_112| Int)) (or (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int) (v_ArrVal_5525 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_112| v_ArrVal_5525) |ULTIMATE.start_sll_append_~last~0#1.base|) (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4)) 0))) (not (< |v_node_create_~temp~0#1.base_112| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_5526 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_112| v_ArrVal_5526) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) (forall ((|v_node_create_~temp~0#1.base_112| Int)) (or (forall ((v_ArrVal_5525 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_112| v_ArrVal_5525) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) (not (< |v_node_create_~temp~0#1.base_112| |c_#StackHeapBarrier|))))) is different from false [2022-12-13 11:27:43,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201749692] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:27:43,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:27:43,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 35 [2022-12-13 11:27:43,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306842418] [2022-12-13 11:27:43,163 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:27:43,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-13 11:27:43,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:27:43,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-13 11:27:43,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1153, Unknown=3, NotChecked=210, Total=1482 [2022-12-13 11:27:43,164 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand has 36 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 31 states have internal predecessors, (94), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 11:27:45,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:27:45,710 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2022-12-13 11:27:45,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 11:27:45,711 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 31 states have internal predecessors, (94), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 77 [2022-12-13 11:27:45,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:27:45,711 INFO L225 Difference]: With dead ends: 90 [2022-12-13 11:27:45,711 INFO L226 Difference]: Without dead ends: 90 [2022-12-13 11:27:45,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=379, Invalid=2383, Unknown=6, NotChecked=312, Total=3080 [2022-12-13 11:27:45,712 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 417 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:27:45,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 335 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 569 Invalid, 0 Unknown, 120 Unchecked, 1.0s Time] [2022-12-13 11:27:45,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-12-13 11:27:45,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-12-13 11:27:45,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 83 states have internal predecessors, (84), 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-12-13 11:27:45,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2022-12-13 11:27:45,715 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 77 [2022-12-13 11:27:45,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:27:45,715 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2022-12-13 11:27:45,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 31 states have internal predecessors, (94), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 11:27:45,716 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2022-12-13 11:27:45,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-12-13 11:27:45,716 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:27:45,716 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-12-13 11:27:45,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-13 11:27:45,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-13 11:27:45,918 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:27:45,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:27:45,919 INFO L85 PathProgramCache]: Analyzing trace with hash -291432927, now seen corresponding path program 1 times [2022-12-13 11:27:45,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:27:45,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534752758] [2022-12-13 11:27:45,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:27:45,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:27:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:47,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:27:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:47,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:27:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:47,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:27:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:47,672 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-13 11:27:47,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:27:47,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534752758] [2022-12-13 11:27:47,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534752758] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:27:47,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868555856] [2022-12-13 11:27:47,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:27:47,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:27:47,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:27:47,673 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:27:47,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-13 11:27:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:47,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 11:27:47,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:27:48,573 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 16 treesize of output 8 [2022-12-13 11:27:48,723 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5693 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5693) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 11:27:48,733 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_5694 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_5694) |c_#memory_$Pointer$.base|)))) is different from true [2022-12-13 11:27:48,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:27:48,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-12-13 11:27:49,219 INFO L321 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-12-13 11:27:49,220 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 38 treesize of output 38 [2022-12-13 11:27:49,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-13 11:27:49,765 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 4 not checked. [2022-12-13 11:27:49,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:27:50,530 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_node_create_~temp~0#1.base_115| Int)) (or (forall ((v_ArrVal_5700 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_115| v_ArrVal_5700) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) (not (< |v_node_create_~temp~0#1.base_115| |c_#StackHeapBarrier|)))) (forall ((|v_node_create_~temp~0#1.base_115| Int)) (or (not (< |v_node_create_~temp~0#1.base_115| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_5700 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_115| v_ArrVal_5700))) (or (<= (+ (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 1) |c_#StackHeapBarrier|) (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int)) (not (= (select (select .cse0 |ULTIMATE.start_sll_append_~last~0#1.base|) (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4)) 0))))))))) is different from false [2022-12-13 11:27:50,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868555856] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:27:50,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:27:50,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 38 [2022-12-13 11:27:50,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742722761] [2022-12-13 11:27:50,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:27:50,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-13 11:27:50,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:27:50,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-13 11:27:50,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1353, Unknown=3, NotChecked=228, Total=1722 [2022-12-13 11:27:50,536 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand has 39 states, 37 states have (on average 2.972972972972973) internal successors, (110), 35 states have internal predecessors, (110), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 11:27:54,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:27:54,690 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2022-12-13 11:27:54,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 11:27:54,690 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 2.972972972972973) internal successors, (110), 35 states have internal predecessors, (110), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 78 [2022-12-13 11:27:54,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:27:54,690 INFO L225 Difference]: With dead ends: 92 [2022-12-13 11:27:54,690 INFO L226 Difference]: Without dead ends: 92 [2022-12-13 11:27:54,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 99 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=414, Invalid=2672, Unknown=6, NotChecked=330, Total=3422 [2022-12-13 11:27:54,691 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 481 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:27:54,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 418 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 737 Invalid, 0 Unknown, 120 Unchecked, 1.3s Time] [2022-12-13 11:27:54,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-12-13 11:27:54,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2022-12-13 11:27:54,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.0625) internal successors, (85), 84 states have internal predecessors, (85), 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-12-13 11:27:54,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2022-12-13 11:27:54,694 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 78 [2022-12-13 11:27:54,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:27:54,694 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2022-12-13 11:27:54,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 2.972972972972973) internal successors, (110), 35 states have internal predecessors, (110), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 11:27:54,694 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2022-12-13 11:27:54,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-12-13 11:27:54,695 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:27:54,695 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2022-12-13 11:27:54,701 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-12-13 11:27:54,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-13 11:27:54,896 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-12-13 11:27:54,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:27:54,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1949273415, now seen corresponding path program 1 times [2022-12-13 11:27:54,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:27:54,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908717488] [2022-12-13 11:27:54,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:27:54,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:27:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:00,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:28:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:01,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:28:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:01,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 11:28:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:03,074 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 11:28:03,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:28:03,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908717488] [2022-12-13 11:28:03,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908717488] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:28:03,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255152149] [2022-12-13 11:28:03,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:28:03,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:28:03,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:28:03,076 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:28:03,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61f7ab6-7be4-4afa-9cd3-730236096d27/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-13 11:28:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:03,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 137 conjunts are in the unsatisfiable core [2022-12-13 11:28:03,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:28:04,366 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-12-13 11:28:05,204 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-12-13 11:28:06,187 INFO L321 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-12-13 11:28:06,188 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 36 treesize of output 32 [2022-12-13 11:28:06,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-13 11:28:06,202 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-12-13 11:28:06,209 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-12-13 11:28:07,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:07,282 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-12-13 11:28:07,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:07,313 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 11:28:07,314 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-12-13 11:28:07,338 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 11:28:07,338 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-12-13 11:28:07,345 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 16 treesize of output 18 [2022-12-13 11:28:07,788 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-12-13 11:28:09,294 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-12-13 11:28:09,294 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 54 [2022-12-13 11:28:09,314 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-12-13 11:28:14,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:28:14,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 63 treesize of output 167 [2022-12-13 11:28:18,573 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 271 treesize of output 231 [2022-12-13 11:28:25,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:56,706 WARN L233 SmtUtils]: Spent 31.51s on a formula simplification. DAG size of input: 1686 DAG size of output: 1590 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-13 11:28:56,711 INFO L321 Elim1Store]: treesize reduction 432, result has 90.2 percent of original size [2022-12-13 11:28:56,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 29 select indices, 29 select index equivalence classes, 1 disjoint index pairs (out of 406 index pairs), introduced 47 new quantified variables, introduced 406 case distinctions, treesize of input 572 treesize of output 4208 [2022-12-13 11:29:04,366 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 11:29:12,180 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 11:29:30,714 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 11:29:31,340 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 11:29:53,143 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 11:30:08,140 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 11:30:17,231 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 11:30:37,902 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 11:30:38,498 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 11:31:00,954 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 11:31:09,021 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 11:31:09,538 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 11:31:30,593 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 11:31:47,126 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 11:31:47,621 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 11:32:10,318 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 11:32:29,005 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-12-13 11:33:33,860 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 11:33:35,217 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 11:34:35,490 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 11:34:44,984 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 11:34:49,481 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 11:34:50,150 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 11:34:55,178 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 11:35:06,008 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 11:35:15,480 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 11:35:19,671 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 11:35:20,393 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 11:35:25,631 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 11:35:28,221 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 11:35:28,780 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts.