./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 4e7fbc69 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_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS --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-4e7fbc6 [2022-11-23 03:45:05,654 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:45:05,657 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:45:05,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:45:05,713 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:45:05,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:45:05,722 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:45:05,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:45:05,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:45:05,734 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:45:05,736 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:45:05,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:45:05,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:45:05,743 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:45:05,745 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:45:05,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:45:05,750 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:45:05,751 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:45:05,753 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:45:05,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:45:05,763 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:45:05,766 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:45:05,768 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:45:05,770 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:45:05,783 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:45:05,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:45:05,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:45:05,787 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:45:05,789 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:45:05,790 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:45:05,791 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:45:05,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:45:05,794 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:45:05,795 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:45:05,797 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:45:05,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:45:05,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:45:05,815 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:45:05,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:45:05,817 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:45:05,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:45:05,819 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-23 03:45:05,882 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:45:05,882 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:45:05,883 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:45:05,883 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:45:05,884 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:45:05,884 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:45:05,885 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:45:05,885 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:45:05,886 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:45:05,886 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:45:05,887 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:45:05,888 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 03:45:05,888 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:45:05,888 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:45:05,888 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:45:05,888 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 03:45:05,889 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 03:45:05,889 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 03:45:05,889 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:45:05,889 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 03:45:05,889 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:45:05,890 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:45:05,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:45:05,890 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:45:05,890 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:45:05,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:45:05,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:45:05,891 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:45:05,892 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 03:45:05,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 03:45:05,893 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:45:05,893 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:45:05,893 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:45:05,893 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_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/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_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS 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-11-23 03:45:06,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:45:06,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:45:06,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:45:06,241 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:45:06,242 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:45:06,243 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2022-11-23 03:45:10,005 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:45:10,385 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:45:10,386 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2022-11-23 03:45:10,426 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/data/bfa81e4e5/d207453799ca402a81e3520a2bec9e4a/FLAG42d94c27f [2022-11-23 03:45:10,444 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/data/bfa81e4e5/d207453799ca402a81e3520a2bec9e4a [2022-11-23 03:45:10,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:45:10,450 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:45:10,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:45:10,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:45:10,456 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:45:10,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:45:10" (1/1) ... [2022-11-23 03:45:10,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d890330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:10, skipping insertion in model container [2022-11-23 03:45:10,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:45:10" (1/1) ... [2022-11-23 03:45:10,468 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:45:10,510 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:45:10,926 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_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2022-11-23 03:45:10,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:45:10,954 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:45:11,009 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_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2022-11-23 03:45:11,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:45:11,043 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:45:11,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:11 WrapperNode [2022-11-23 03:45:11,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:45:11,046 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:45:11,046 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:45:11,046 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:45:11,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:11" (1/1) ... [2022-11-23 03:45:11,073 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:11" (1/1) ... [2022-11-23 03:45:11,101 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2022-11-23 03:45:11,101 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:45:11,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:45:11,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:45:11,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:45:11,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:11" (1/1) ... [2022-11-23 03:45:11,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:11" (1/1) ... [2022-11-23 03:45:11,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:11" (1/1) ... [2022-11-23 03:45:11,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:11" (1/1) ... [2022-11-23 03:45:11,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:11" (1/1) ... [2022-11-23 03:45:11,134 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:11" (1/1) ... [2022-11-23 03:45:11,136 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:11" (1/1) ... [2022-11-23 03:45:11,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:11" (1/1) ... [2022-11-23 03:45:11,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:45:11,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:45:11,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:45:11,143 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:45:11,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:11" (1/1) ... [2022-11-23 03:45:11,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:45:11,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:45:11,185 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:45:11,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:45:11,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 03:45:11,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 03:45:11,249 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-23 03:45:11,249 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-23 03:45:11,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 03:45:11,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:45:11,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 03:45:11,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 03:45:11,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 03:45:11,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 03:45:11,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-23 03:45:11,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 03:45:11,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:45:11,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:45:11,417 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:45:11,420 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:45:11,875 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:45:11,883 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:45:11,884 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-23 03:45:11,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:45:11 BoogieIcfgContainer [2022-11-23 03:45:11,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:45:11,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:45:11,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:45:11,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:45:11,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:45:10" (1/3) ... [2022-11-23 03:45:11,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6214c2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:45:11, skipping insertion in model container [2022-11-23 03:45:11,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:11" (2/3) ... [2022-11-23 03:45:11,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6214c2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:45:11, skipping insertion in model container [2022-11-23 03:45:11,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:45:11" (3/3) ... [2022-11-23 03:45:11,898 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2022-11-23 03:45:11,922 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:45:11,923 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2022-11-23 03:45:11,984 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 03:45:11,993 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;@3a08615b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 03:45:11,993 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2022-11-23 03:45:11,999 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-11-23 03:45:12,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 03:45:12,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:45:12,009 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:45:12,010 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-11-23 03:45:12,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:45:12,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1813904761, now seen corresponding path program 1 times [2022-11-23 03:45:12,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:45:12,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726954628] [2022-11-23 03:45:12,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:12,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:45:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:12,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:45:12,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:45:12,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726954628] [2022-11-23 03:45:12,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726954628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:45:12,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:45:12,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:45:12,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490077825] [2022-11-23 03:45:12,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:45:12,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:45:12,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:45:12,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:45:12,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:45:12,521 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-11-23 03:45:12,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:45:12,680 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2022-11-23 03:45:12,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:45:12,683 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-11-23 03:45:12,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:45:12,694 INFO L225 Difference]: With dead ends: 83 [2022-11-23 03:45:12,694 INFO L226 Difference]: Without dead ends: 80 [2022-11-23 03:45:12,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:45:12,700 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 8 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11-23 03:45:12,702 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-11-23 03:45:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-23 03:45:12,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-23 03:45:12,743 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-11-23 03:45:12,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2022-11-23 03:45:12,747 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 7 [2022-11-23 03:45:12,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:45:12,748 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2022-11-23 03:45:12,748 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-11-23 03:45:12,748 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2022-11-23 03:45:12,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 03:45:12,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:45:12,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:45:12,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 03:45:12,750 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-11-23 03:45:12,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:45:12,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1813904762, now seen corresponding path program 1 times [2022-11-23 03:45:12,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:45:12,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338549289] [2022-11-23 03:45:12,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:12,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:45:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:12,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:45:12,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:45:12,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338549289] [2022-11-23 03:45:12,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338549289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:45:12,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:45:12,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:45:12,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56934928] [2022-11-23 03:45:12,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:45:12,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:45:12,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:45:12,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:45:12,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:45:12,900 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-11-23 03:45:12,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:45:12,988 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-11-23 03:45:12,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:45:12,988 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-11-23 03:45:12,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:45:12,990 INFO L225 Difference]: With dead ends: 78 [2022-11-23 03:45:12,990 INFO L226 Difference]: Without dead ends: 78 [2022-11-23 03:45:12,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:45:12,992 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:45:12,993 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.1s Time] [2022-11-23 03:45:12,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-23 03:45:13,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-23 03:45:13,001 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-11-23 03:45:13,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2022-11-23 03:45:13,003 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 7 [2022-11-23 03:45:13,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:45:13,004 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2022-11-23 03:45:13,004 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-11-23 03:45:13,004 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2022-11-23 03:45:13,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 03:45:13,005 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:45:13,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:45:13,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 03:45:13,006 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-11-23 03:45:13,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:45:13,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1961810752, now seen corresponding path program 1 times [2022-11-23 03:45:13,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:45:13,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821328458] [2022-11-23 03:45:13,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:13,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:45:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:13,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:45:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:13,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:45:13,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:45:13,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821328458] [2022-11-23 03:45:13,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821328458] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:45:13,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:45:13,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 03:45:13,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493332023] [2022-11-23 03:45:13,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:45:13,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 03:45:13,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:45:13,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 03:45:13,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:45:13,335 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-11-23 03:45:13,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:45:13,686 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2022-11-23 03:45:13,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:45:13,687 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-11-23 03:45:13,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:45:13,698 INFO L225 Difference]: With dead ends: 82 [2022-11-23 03:45:13,698 INFO L226 Difference]: Without dead ends: 82 [2022-11-23 03:45:13,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:45:13,704 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 11 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:45:13,705 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.3s Time] [2022-11-23 03:45:13,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-23 03:45:13,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2022-11-23 03:45:13,718 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-11-23 03:45:13,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2022-11-23 03:45:13,720 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 13 [2022-11-23 03:45:13,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:45:13,721 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2022-11-23 03:45:13,721 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-11-23 03:45:13,722 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2022-11-23 03:45:13,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 03:45:13,723 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:45:13,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:45:13,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 03:45:13,724 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-11-23 03:45:13,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:45:13,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1961810753, now seen corresponding path program 1 times [2022-11-23 03:45:13,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:45:13,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940650540] [2022-11-23 03:45:13,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:13,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:45:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:14,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:45:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:14,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:45:14,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:45:14,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940650540] [2022-11-23 03:45:14,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940650540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:45:14,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:45:14,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 03:45:14,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046953973] [2022-11-23 03:45:14,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:45:14,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 03:45:14,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:45:14,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 03:45:14,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:45:14,267 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-11-23 03:45:14,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:45:14,533 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2022-11-23 03:45:14,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:45:14,534 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-11-23 03:45:14,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:45:14,535 INFO L225 Difference]: With dead ends: 81 [2022-11-23 03:45:14,535 INFO L226 Difference]: Without dead ends: 81 [2022-11-23 03:45:14,535 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-11-23 03:45:14,539 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 9 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-11-23 03:45:14,543 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-11-23 03:45:14,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-23 03:45:14,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2022-11-23 03:45:14,558 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-11-23 03:45:14,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2022-11-23 03:45:14,560 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 13 [2022-11-23 03:45:14,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:45:14,561 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2022-11-23 03:45:14,561 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-11-23 03:45:14,561 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-11-23 03:45:14,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 03:45:14,562 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:45:14,565 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:45:14,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 03:45:14,565 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-11-23 03:45:14,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:45:14,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1399608384, now seen corresponding path program 1 times [2022-11-23 03:45:14,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:45:14,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308675350] [2022-11-23 03:45:14,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:14,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:45:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:14,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-23 03:45:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:14,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:45:14,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:45:14,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308675350] [2022-11-23 03:45:14,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308675350] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:45:14,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:45:14,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:45:14,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529684525] [2022-11-23 03:45:14,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:45:14,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:45:14,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:45:14,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:45:14,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:45:14,725 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-11-23 03:45:14,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:45:14,852 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2022-11-23 03:45:14,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:45:14,857 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-11-23 03:45:14,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:45:14,858 INFO L225 Difference]: With dead ends: 82 [2022-11-23 03:45:14,858 INFO L226 Difference]: Without dead ends: 82 [2022-11-23 03:45:14,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:45:14,862 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 4 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11-23 03:45:14,863 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-11-23 03:45:14,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-23 03:45:14,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2022-11-23 03:45:14,883 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-11-23 03:45:14,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2022-11-23 03:45:14,886 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 15 [2022-11-23 03:45:14,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:45:14,887 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2022-11-23 03:45:14,887 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-11-23 03:45:14,890 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2022-11-23 03:45:14,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 03:45:14,892 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:45:14,893 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-11-23 03:45:14,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 03:45:14,894 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-11-23 03:45:14,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:45:14,896 INFO L85 PathProgramCache]: Analyzing trace with hash -898428094, now seen corresponding path program 1 times [2022-11-23 03:45:14,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:45:14,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217274804] [2022-11-23 03:45:14,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:14,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:45:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:15,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:45:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:15,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-23 03:45:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:15,120 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 03:45:15,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:45:15,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217274804] [2022-11-23 03:45:15,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217274804] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:45:15,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389374942] [2022-11-23 03:45:15,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:15,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:45:15,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:45:15,131 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:45:15,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 03:45:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:15,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 03:45:15,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:45:15,418 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:45:15,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:45:15,502 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 03:45:15,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389374942] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:45:15,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:45:15,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-11-23 03:45:15,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465455150] [2022-11-23 03:45:15,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:45:15,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:45:15,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:45:15,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:45:15,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:45:15,507 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-11-23 03:45:15,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:45:15,664 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2022-11-23 03:45:15,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:45:15,665 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-11-23 03:45:15,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:45:15,666 INFO L225 Difference]: With dead ends: 83 [2022-11-23 03:45:15,666 INFO L226 Difference]: Without dead ends: 83 [2022-11-23 03:45:15,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:45:15,667 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 8 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:45:15,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 267 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 03:45:15,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-23 03:45:15,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-11-23 03:45:15,673 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-11-23 03:45:15,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2022-11-23 03:45:15,674 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 28 [2022-11-23 03:45:15,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:45:15,675 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2022-11-23 03:45:15,675 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-11-23 03:45:15,675 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2022-11-23 03:45:15,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-23 03:45:15,676 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:45:15,677 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-11-23 03:45:15,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 03:45:15,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:45:15,899 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-11-23 03:45:15,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:45:15,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1437186176, now seen corresponding path program 2 times [2022-11-23 03:45:15,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:45:15,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439259788] [2022-11-23 03:45:15,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:15,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:45:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:16,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:45:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:16,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:45:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:16,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:45:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:16,580 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-23 03:45:16,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:45:16,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439259788] [2022-11-23 03:45:16,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439259788] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:45:16,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:45:16,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 03:45:16,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77948538] [2022-11-23 03:45:16,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:45:16,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 03:45:16,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:45:16,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 03:45:16,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:45:16,584 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-11-23 03:45:16,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:45:16,821 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2022-11-23 03:45:16,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:45:16,822 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-11-23 03:45:16,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:45:16,823 INFO L225 Difference]: With dead ends: 90 [2022-11-23 03:45:16,823 INFO L226 Difference]: Without dead ends: 90 [2022-11-23 03:45:16,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:45:16,824 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 113 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:45:16,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 173 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 03:45:16,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-23 03:45:16,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2022-11-23 03:45:16,830 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-11-23 03:45:16,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2022-11-23 03:45:16,830 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 41 [2022-11-23 03:45:16,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:45:16,838 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2022-11-23 03:45:16,840 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-11-23 03:45:16,841 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2022-11-23 03:45:16,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-23 03:45:16,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:45:16,843 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-11-23 03:45:16,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 03:45:16,844 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-11-23 03:45:16,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:45:16,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1437186175, now seen corresponding path program 1 times [2022-11-23 03:45:16,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:45:16,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220992451] [2022-11-23 03:45:16,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:16,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:45:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:17,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:45:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:17,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:45:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:17,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:45:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:18,023 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-23 03:45:18,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:45:18,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220992451] [2022-11-23 03:45:18,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220992451] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:45:18,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188541241] [2022-11-23 03:45:18,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:18,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:45:18,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:45:18,026 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:45:18,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 03:45:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:18,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-23 03:45:18,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:45:18,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:45:18,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 03:45:18,416 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-11-23 03:45:18,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:45:18,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 03:45:18,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 03:45:18,623 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-11-23 03:45:18,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:45:18,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 03:45:18,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 03:45:18,817 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-11-23 03:45:18,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:45:18,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 03:45:18,947 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 18 not checked. [2022-11-23 03:45:18,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:45:19,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188541241] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:45:19,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:45:19,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2022-11-23 03:45:19,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074295727] [2022-11-23 03:45:19,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:45:19,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-23 03:45:19,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:45:19,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-23 03:45:19,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=220, Unknown=3, NotChecked=96, Total=380 [2022-11-23 03:45:19,173 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-11-23 03:45:19,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:45:19,683 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2022-11-23 03:45:19,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 03:45:19,684 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-11-23 03:45:19,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:45:19,685 INFO L225 Difference]: With dead ends: 85 [2022-11-23 03:45:19,685 INFO L226 Difference]: Without dead ends: 85 [2022-11-23 03:45:19,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=268, Unknown=3, NotChecked=108, Total=462 [2022-11-23 03:45:19,687 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 317 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 198 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 03:45:19,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 186 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 244 Invalid, 0 Unknown, 198 Unchecked, 0.4s Time] [2022-11-23 03:45:19,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-23 03:45:19,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2022-11-23 03:45:19,693 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-11-23 03:45:19,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-11-23 03:45:19,695 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 41 [2022-11-23 03:45:19,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:45:19,695 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-11-23 03:45:19,699 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-11-23 03:45:19,699 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-11-23 03:45:19,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-23 03:45:19,704 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:45:19,704 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-11-23 03:45:19,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 03:45:19,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:45:19,912 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-11-23 03:45:19,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:45:19,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2129253767, now seen corresponding path program 1 times [2022-11-23 03:45:19,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:45:19,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743496750] [2022-11-23 03:45:19,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:19,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:45:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:20,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:45:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:20,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:45:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:21,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:45:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:21,649 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 03:45:21,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:45:21,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743496750] [2022-11-23 03:45:21,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743496750] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:45:21,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698320323] [2022-11-23 03:45:21,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:21,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:45:21,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:45:21,656 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:45:21,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 03:45:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:21,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-23 03:45:21,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:45:22,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 03:45:22,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 03:45:22,739 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-11-23 03:45:22,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:45:22,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-23 03:45:22,863 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-23 03:45:22,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-23 03:45:22,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-11-23 03:45:22,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:45:22,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 03:45:22,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 03:45:22,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-23 03:45:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-11-23 03:45:23,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:45:24,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698320323] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:45:24,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:45:24,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2022-11-23 03:45:24,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616442309] [2022-11-23 03:45:24,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:45:24,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-23 03:45:24,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:45:24,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-23 03:45:24,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1084, Unknown=1, NotChecked=66, Total=1260 [2022-11-23 03:45:24,635 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-11-23 03:45:26,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:45:26,926 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2022-11-23 03:45:26,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-23 03:45:26,927 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-11-23 03:45:26,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:45:26,928 INFO L225 Difference]: With dead ends: 112 [2022-11-23 03:45:26,928 INFO L226 Difference]: Without dead ends: 112 [2022-11-23 03:45:26,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=241, Invalid=2018, Unknown=1, NotChecked=92, Total=2352 [2022-11-23 03:45:26,931 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 349 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:45:26,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 924 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 996 Invalid, 0 Unknown, 104 Unchecked, 1.1s Time] [2022-11-23 03:45:26,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-23 03:45:26,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 77. [2022-11-23 03:45:26,946 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-11-23 03:45:26,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2022-11-23 03:45:26,947 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 45 [2022-11-23 03:45:26,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:45:26,947 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2022-11-23 03:45:26,948 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-11-23 03:45:26,948 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2022-11-23 03:45:26,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-23 03:45:26,949 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:45:26,949 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-11-23 03:45:26,964 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 03:45:27,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-23 03:45:27,150 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-11-23 03:45:27,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:45:27,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2129253766, now seen corresponding path program 1 times [2022-11-23 03:45:27,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:45:27,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164467473] [2022-11-23 03:45:27,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:27,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:45:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:27,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:45:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:27,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:45:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:27,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:45:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:28,126 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 03:45:28,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:45:28,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164467473] [2022-11-23 03:45:28,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164467473] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:45:28,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465488747] [2022-11-23 03:45:28,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:28,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:45:28,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:45:28,129 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:45:28,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 03:45:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:28,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-23 03:45:28,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:45:28,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-23 03:45:28,802 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-11-23 03:45:28,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:45:28,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 03:45:28,864 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-23 03:45:28,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 03:45:28,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-23 03:45:29,019 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-23 03:45:29,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:45:29,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465488747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:45:29,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 03:45:29,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2022-11-23 03:45:29,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262483104] [2022-11-23 03:45:29,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:45:29,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 03:45:29,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:45:29,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 03:45:29,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=575, Unknown=2, NotChecked=48, Total=702 [2022-11-23 03:45:29,028 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-11-23 03:45:29,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:45:29,665 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2022-11-23 03:45:29,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 03:45:29,666 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-11-23 03:45:29,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:45:29,667 INFO L225 Difference]: With dead ends: 104 [2022-11-23 03:45:29,667 INFO L226 Difference]: Without dead ends: 104 [2022-11-23 03:45:29,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=121, Invalid=811, Unknown=2, NotChecked=58, Total=992 [2022-11-23 03:45:29,670 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 61 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 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.5s IncrementalHoareTripleChecker+Time [2022-11-23 03:45:29,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 518 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 415 Invalid, 3 Unknown, 120 Unchecked, 0.5s Time] [2022-11-23 03:45:29,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-23 03:45:29,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 75. [2022-11-23 03:45:29,675 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-11-23 03:45:29,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2022-11-23 03:45:29,676 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 45 [2022-11-23 03:45:29,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:45:29,677 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2022-11-23 03:45:29,677 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-11-23 03:45:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2022-11-23 03:45:29,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-23 03:45:29,679 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:45:29,679 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-11-23 03:45:29,687 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-23 03:45:29,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-23 03:45:29,887 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-11-23 03:45:29,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:45:29,887 INFO L85 PathProgramCache]: Analyzing trace with hash -35949242, now seen corresponding path program 1 times [2022-11-23 03:45:29,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:45:29,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565030127] [2022-11-23 03:45:29,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:29,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:45:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:30,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:45:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:30,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:45:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:30,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:45:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:30,289 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-23 03:45:30,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:45:30,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565030127] [2022-11-23 03:45:30,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565030127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:45:30,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:45:30,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-23 03:45:30,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123965764] [2022-11-23 03:45:30,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:45:30,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 03:45:30,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:45:30,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 03:45:30,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-23 03:45:30,292 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-11-23 03:45:30,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:45:30,639 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2022-11-23 03:45:30,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 03:45:30,640 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-11-23 03:45:30,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:45:30,641 INFO L225 Difference]: With dead ends: 136 [2022-11-23 03:45:30,642 INFO L226 Difference]: Without dead ends: 136 [2022-11-23 03:45:30,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-11-23 03:45:30,643 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 167 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 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.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:45:30,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 310 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 03:45:30,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-23 03:45:30,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 79. [2022-11-23 03:45:30,648 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-11-23 03:45:30,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2022-11-23 03:45:30,649 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 48 [2022-11-23 03:45:30,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:45:30,650 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2022-11-23 03:45:30,650 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-11-23 03:45:30,650 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2022-11-23 03:45:30,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-23 03:45:30,651 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:45:30,651 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-11-23 03:45:30,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 03:45:30,652 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-11-23 03:45:30,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:45:30,653 INFO L85 PathProgramCache]: Analyzing trace with hash -35949241, now seen corresponding path program 1 times [2022-11-23 03:45:30,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:45:30,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036726379] [2022-11-23 03:45:30,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:30,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:45:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:31,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:45:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:31,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:45:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:31,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:45:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:31,289 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-23 03:45:31,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:45:31,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036726379] [2022-11-23 03:45:31,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036726379] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:45:31,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:45:31,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-23 03:45:31,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040970951] [2022-11-23 03:45:31,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:45:31,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 03:45:31,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:45:31,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 03:45:31,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-23 03:45:31,293 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-11-23 03:45:31,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:45:31,676 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2022-11-23 03:45:31,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 03:45:31,677 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-11-23 03:45:31,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:45:31,678 INFO L225 Difference]: With dead ends: 126 [2022-11-23 03:45:31,678 INFO L226 Difference]: Without dead ends: 126 [2022-11-23 03:45:31,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-23 03:45:31,679 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 153 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 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.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:45:31,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 323 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 03:45:31,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-23 03:45:31,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 81. [2022-11-23 03:45:31,683 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-11-23 03:45:31,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2022-11-23 03:45:31,684 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 48 [2022-11-23 03:45:31,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:45:31,685 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2022-11-23 03:45:31,685 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-11-23 03:45:31,686 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2022-11-23 03:45:31,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-23 03:45:31,686 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:45:31,687 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-11-23 03:45:31,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 03:45:31,687 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-11-23 03:45:31,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:45:31,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1114427801, now seen corresponding path program 1 times [2022-11-23 03:45:31,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:45:31,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055185017] [2022-11-23 03:45:31,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:31,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:45:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:31,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:45:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:31,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:45:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:31,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:45:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:32,106 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-23 03:45:32,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:45:32,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055185017] [2022-11-23 03:45:32,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055185017] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:45:32,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:45:32,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-23 03:45:32,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196856446] [2022-11-23 03:45:32,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:45:32,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 03:45:32,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:45:32,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 03:45:32,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-23 03:45:32,109 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-11-23 03:45:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:45:32,431 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2022-11-23 03:45:32,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 03:45:32,432 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-11-23 03:45:32,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:45:32,432 INFO L225 Difference]: With dead ends: 109 [2022-11-23 03:45:32,433 INFO L226 Difference]: Without dead ends: 109 [2022-11-23 03:45:32,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-23 03:45:32,434 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 155 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 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.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:45:32,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 508 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 03:45:32,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-23 03:45:32,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 81. [2022-11-23 03:45:32,438 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-11-23 03:45:32,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2022-11-23 03:45:32,439 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 49 [2022-11-23 03:45:32,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:45:32,440 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2022-11-23 03:45:32,440 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-11-23 03:45:32,440 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2022-11-23 03:45:32,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-23 03:45:32,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:45:32,441 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-11-23 03:45:32,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 03:45:32,442 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-11-23 03:45:32,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:45:32,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1553828739, now seen corresponding path program 1 times [2022-11-23 03:45:32,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:45:32,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827497532] [2022-11-23 03:45:32,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:32,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:45:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:34,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:45:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:34,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:45:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:34,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:45:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 03:45:35,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:45:35,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827497532] [2022-11-23 03:45:35,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827497532] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:45:35,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305616144] [2022-11-23 03:45:35,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:35,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:45:35,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:45:35,581 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:45:35,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 03:45:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:35,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 104 conjunts are in the unsatisfiable core [2022-11-23 03:45:35,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:45:36,417 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 03:45:36,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-23 03:45:36,435 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-11-23 03:45:36,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:45:36,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:45:37,364 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:45:37,365 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-11-23 03:45:37,381 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:45:37,381 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-11-23 03:45:37,724 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-11-23 03:45:37,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:45:37,840 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 03:45:37,847 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-11-23 03:45:37,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:45:37,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:45:37,868 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-23 03:45:37,869 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-11-23 03:45:37,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:45:37,881 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-11-23 03:45:37,905 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-23 03:45:37,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-23 03:45:38,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:45:38,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:45:38,452 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:45:38,453 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-11-23 03:45:38,466 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-11-23 03:45:38,470 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-11-23 03:45:38,626 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-23 03:45:38,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:45:41,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305616144] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:45:41,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:45:41,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22] total 48 [2022-11-23 03:45:41,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801144067] [2022-11-23 03:45:41,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:45:41,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-23 03:45:41,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:45:41,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-23 03:45:41,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2496, Unknown=2, NotChecked=100, Total=2756 [2022-11-23 03:45:41,380 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-11-23 03:45:51,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:45:51,027 INFO L93 Difference]: Finished difference Result 183 states and 200 transitions. [2022-11-23 03:45:51,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-23 03:45:51,027 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-11-23 03:45:51,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:45:51,029 INFO L225 Difference]: With dead ends: 183 [2022-11-23 03:45:51,029 INFO L226 Difference]: Without dead ends: 183 [2022-11-23 03:45:51,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=698, Invalid=5466, Unknown=2, NotChecked=154, Total=6320 [2022-11-23 03:45:51,032 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 1332 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 1997 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1332 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1997 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-23 03:45:51,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1332 Valid, 1347 Invalid, 2219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1997 Invalid, 1 Unknown, 162 Unchecked, 2.8s Time] [2022-11-23 03:45:51,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-23 03:45:51,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 80. [2022-11-23 03:45:51,036 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-11-23 03:45:51,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2022-11-23 03:45:51,037 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 49 [2022-11-23 03:45:51,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:45:51,038 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2022-11-23 03:45:51,038 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-11-23 03:45:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-11-23 03:45:51,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-23 03:45:51,039 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:45:51,040 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-11-23 03:45:51,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 03:45:51,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-23 03:45:51,252 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-11-23 03:45:51,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:45:51,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1553828740, now seen corresponding path program 1 times [2022-11-23 03:45:51,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:45:51,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89479523] [2022-11-23 03:45:51,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:51,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:45:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:52,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:45:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:52,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:45:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:53,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:45:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:53,755 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 03:45:53,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:45:53,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89479523] [2022-11-23 03:45:53,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89479523] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:45:53,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195916997] [2022-11-23 03:45:53,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:53,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:45:53,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:45:53,764 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:45:53,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 03:45:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:54,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 91 conjunts are in the unsatisfiable core [2022-11-23 03:45:54,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:45:54,414 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-23 03:45:54,414 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-11-23 03:45:54,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:45:55,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:45:55,094 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:45:55,094 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-11-23 03:45:55,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 03:45:55,371 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-11-23 03:45:55,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:45:55,442 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 03:45:55,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 55 [2022-11-23 03:45:55,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:45:55,452 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-11-23 03:45:55,503 INFO L321 Elim1Store]: treesize reduction 90, result has 37.9 percent of original size [2022-11-23 03:45:55,503 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-11-23 03:45:55,790 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-11-23 03:45:56,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:45:56,155 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:45:56,156 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-11-23 03:45:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-23 03:45:56,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:45:56,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195916997] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:45:56,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:45:56,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 45 [2022-11-23 03:45:56,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855323286] [2022-11-23 03:45:56,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:45:56,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-23 03:45:56,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:45:56,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-23 03:45:56,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2177, Unknown=2, NotChecked=94, Total=2450 [2022-11-23 03:45:56,739 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-11-23 03:46:01,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:46:01,501 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2022-11-23 03:46:01,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 03:46:01,501 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-11-23 03:46:01,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:46:01,502 INFO L225 Difference]: With dead ends: 122 [2022-11-23 03:46:01,503 INFO L226 Difference]: Without dead ends: 122 [2022-11-23 03:46:01,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=528, Invalid=4164, Unknown=4, NotChecked=134, Total=4830 [2022-11-23 03:46:01,505 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 608 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 37 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 1710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-23 03:46:01,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 1353 Invalid, 1710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1561 Invalid, 3 Unknown, 109 Unchecked, 1.8s Time] [2022-11-23 03:46:01,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-23 03:46:01,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 80. [2022-11-23 03:46:01,510 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-11-23 03:46:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2022-11-23 03:46:01,511 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 49 [2022-11-23 03:46:01,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:46:01,511 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2022-11-23 03:46:01,511 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-11-23 03:46:01,512 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2022-11-23 03:46:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-23 03:46:01,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:46:01,513 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-11-23 03:46:01,521 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 03:46:01,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:46:01,721 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-11-23 03:46:01,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:46:01,721 INFO L85 PathProgramCache]: Analyzing trace with hash 218878957, now seen corresponding path program 1 times [2022-11-23 03:46:01,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:46:01,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344092916] [2022-11-23 03:46:01,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:46:01,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:46:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:02,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:46:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:02,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:46:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:02,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:46:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:02,370 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 03:46:02,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:46:02,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344092916] [2022-11-23 03:46:02,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344092916] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:46:02,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876137926] [2022-11-23 03:46:02,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:46:02,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:46:02,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:46:02,372 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:46:02,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 03:46:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:02,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-23 03:46:02,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:46:02,904 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-11-23 03:46:03,207 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-11-23 03:46:03,215 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-11-23 03:46:03,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:46:03,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-23 03:46:03,296 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-11-23 03:46:03,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 03:46:03,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 03:46:03,454 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-23 03:46:03,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:46:03,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876137926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:46:03,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 03:46:03,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 27 [2022-11-23 03:46:03,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543808789] [2022-11-23 03:46:03,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:46:03,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 03:46:03,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:46:03,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 03:46:03,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-11-23 03:46:03,457 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-11-23 03:46:04,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:46:04,217 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2022-11-23 03:46:04,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-23 03:46:04,217 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-11-23 03:46:04,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:46:04,218 INFO L225 Difference]: With dead ends: 106 [2022-11-23 03:46:04,219 INFO L226 Difference]: Without dead ends: 106 [2022-11-23 03:46:04,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2022-11-23 03:46:04,220 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 139 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 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.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:46:04,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 530 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 03:46:04,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-23 03:46:04,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 81. [2022-11-23 03:46:04,223 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-11-23 03:46:04,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2022-11-23 03:46:04,224 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 52 [2022-11-23 03:46:04,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:46:04,225 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2022-11-23 03:46:04,225 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-11-23 03:46:04,225 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2022-11-23 03:46:04,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-23 03:46:04,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:46:04,226 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-11-23 03:46:04,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 03:46:04,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-23 03:46:04,427 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-11-23 03:46:04,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:46:04,427 INFO L85 PathProgramCache]: Analyzing trace with hash -521057353, now seen corresponding path program 1 times [2022-11-23 03:46:04,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:46:04,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309773466] [2022-11-23 03:46:04,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:46:04,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:46:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:04,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:46:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:04,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:46:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:05,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:46:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:05,275 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 03:46:05,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:46:05,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309773466] [2022-11-23 03:46:05,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309773466] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:46:05,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564475573] [2022-11-23 03:46:05,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:46:05,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:46:05,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:46:05,278 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:46:05,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 03:46:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:05,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-23 03:46:05,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:46:05,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:46:05,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 03:46:05,633 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-11-23 03:46:05,649 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-11-23 03:46:05,677 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 03:46:05,677 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-11-23 03:46:05,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 03:46:05,915 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 03:46:05,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 03:46:06,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 18 treesize of output 10 [2022-11-23 03:46:06,500 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-11-23 03:46:06,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:46:06,550 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-11-23 03:46:06,573 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-23 03:46:06,574 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-11-23 03:46:06,844 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:46:06,844 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-11-23 03:46:06,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-23 03:46:06,923 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 15 not checked. [2022-11-23 03:46:06,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:46:06,942 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-11-23 03:46:09,089 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-11-23 03:46:09,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564475573] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:46:09,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:46:09,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 42 [2022-11-23 03:46:09,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593198513] [2022-11-23 03:46:09,264 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:46:09,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-23 03:46:09,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:46:09,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-23 03:46:09,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1566, Unknown=23, NotChecked=420, Total=2162 [2022-11-23 03:46:09,267 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-11-23 03:46:11,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:46:11,390 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2022-11-23 03:46:11,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-23 03:46:11,391 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-11-23 03:46:11,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:46:11,393 INFO L225 Difference]: With dead ends: 156 [2022-11-23 03:46:11,393 INFO L226 Difference]: Without dead ends: 156 [2022-11-23 03:46:11,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=464, Invalid=2955, Unknown=23, NotChecked=590, Total=4032 [2022-11-23 03:46:11,399 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 961 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 36 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 1412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 341 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:46:11,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [961 Valid, 686 Invalid, 1412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1032 Invalid, 3 Unknown, 341 Unchecked, 1.0s Time] [2022-11-23 03:46:11,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-23 03:46:11,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 87. [2022-11-23 03:46:11,407 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-11-23 03:46:11,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2022-11-23 03:46:11,408 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 52 [2022-11-23 03:46:11,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:46:11,408 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2022-11-23 03:46:11,409 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-11-23 03:46:11,409 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2022-11-23 03:46:11,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-23 03:46:11,410 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:46:11,410 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-11-23 03:46:11,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 03:46:11,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-23 03:46:11,618 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-11-23 03:46:11,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:46:11,618 INFO L85 PathProgramCache]: Analyzing trace with hash -521057352, now seen corresponding path program 1 times [2022-11-23 03:46:11,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:46:11,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401403643] [2022-11-23 03:46:11,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:46:11,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:46:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:12,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:46:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:12,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:46:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:12,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:46:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:13,291 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 03:46:13,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:46:13,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401403643] [2022-11-23 03:46:13,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401403643] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:46:13,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857718773] [2022-11-23 03:46:13,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:46:13,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:46:13,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:46:13,296 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:46:13,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 03:46:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:13,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-23 03:46:13,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:46:14,207 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-11-23 03:46:14,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 03:46:14,374 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-11-23 03:46:14,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:46:14,426 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-11-23 03:46:14,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:46:14,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 03:46:15,018 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 03:46:15,019 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-11-23 03:46:15,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:46:15,039 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-11-23 03:46:15,051 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-11-23 03:46:15,161 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-11-23 03:46:15,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-23 03:46:15,293 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-11-23 03:46:15,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:46:15,875 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:46:15,875 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-11-23 03:46:18,987 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-11-23 03:46:18,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857718773] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:46:18,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:46:18,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 37 [2022-11-23 03:46:18,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387818047] [2022-11-23 03:46:18,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:46:18,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-23 03:46:18,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:46:18,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-23 03:46:18,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1821, Unknown=10, NotChecked=174, Total=2162 [2022-11-23 03:46:18,994 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-11-23 03:46:22,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:46:22,083 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2022-11-23 03:46:22,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 03:46:22,085 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-11-23 03:46:22,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:46:22,087 INFO L225 Difference]: With dead ends: 117 [2022-11-23 03:46:22,087 INFO L226 Difference]: Without dead ends: 117 [2022-11-23 03:46:22,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=461, Invalid=3319, Unknown=10, NotChecked=242, Total=4032 [2022-11-23 03:46:22,089 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 590 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:46:22,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 811 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 793 Invalid, 0 Unknown, 104 Unchecked, 1.0s Time] [2022-11-23 03:46:22,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-23 03:46:22,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 89. [2022-11-23 03:46:22,093 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-11-23 03:46:22,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2022-11-23 03:46:22,094 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 52 [2022-11-23 03:46:22,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:46:22,095 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2022-11-23 03:46:22,095 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-11-23 03:46:22,095 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-11-23 03:46:22,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-23 03:46:22,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:46:22,096 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-11-23 03:46:22,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 03:46:22,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-23 03:46:22,305 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-11-23 03:46:22,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:46:22,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1804686442, now seen corresponding path program 1 times [2022-11-23 03:46:22,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:46:22,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757860004] [2022-11-23 03:46:22,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:46:22,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:46:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:22,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:46:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:22,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:46:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:22,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:46:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:22,973 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 03:46:22,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:46:22,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757860004] [2022-11-23 03:46:22,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757860004] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:46:22,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207527328] [2022-11-23 03:46:22,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:46:22,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:46:22,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:46:22,976 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:46:22,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 03:46:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:23,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-23 03:46:23,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:46:23,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-23 03:46:23,779 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-11-23 03:46:23,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:46:23,810 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-11-23 03:46:23,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-23 03:46:23,921 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 3 not checked. [2022-11-23 03:46:23,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:46:24,054 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2148 (Array Int Int)) (|v_node_create_~temp~0#1.base_37| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_37| v_ArrVal_2148) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (not (< |v_node_create_~temp~0#1.base_37| |c_#StackHeapBarrier|)) (<= 1 .cse0) (<= (+ .cse0 1) 0)))) is different from false [2022-11-23 03:46:24,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207527328] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:46:24,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:46:24,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2022-11-23 03:46:24,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449081492] [2022-11-23 03:46:24,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:46:24,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-23 03:46:24,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:46:24,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-23 03:46:24,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=571, Unknown=2, NotChecked=98, Total=756 [2022-11-23 03:46:24,058 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-11-23 03:46:24,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:46:24,937 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2022-11-23 03:46:24,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 03:46:24,938 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-11-23 03:46:24,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:46:24,939 INFO L225 Difference]: With dead ends: 80 [2022-11-23 03:46:24,939 INFO L226 Difference]: Without dead ends: 80 [2022-11-23 03:46:24,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=172, Invalid=956, Unknown=2, NotChecked=130, Total=1260 [2022-11-23 03:46:24,941 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 315 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 03:46:24,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 551 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 449 Invalid, 0 Unknown, 68 Unchecked, 0.4s Time] [2022-11-23 03:46:24,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-23 03:46:24,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-23 03:46:24,944 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-11-23 03:46:24,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2022-11-23 03:46:24,947 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 53 [2022-11-23 03:46:24,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:46:24,948 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2022-11-23 03:46:24,948 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-11-23 03:46:24,949 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2022-11-23 03:46:24,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-23 03:46:24,949 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:46:24,950 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-11-23 03:46:24,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 03:46:25,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:46:25,157 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-11-23 03:46:25,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:46:25,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1947817869, now seen corresponding path program 2 times [2022-11-23 03:46:25,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:46:25,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805352687] [2022-11-23 03:46:25,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:46:25,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:46:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:27,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:46:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:27,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:46:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:28,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:46:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:29,259 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 03:46:29,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:46:29,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805352687] [2022-11-23 03:46:29,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805352687] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:46:29,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774992507] [2022-11-23 03:46:29,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 03:46:29,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:46:29,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:46:29,262 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:46:29,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 03:46:29,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 03:46:29,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:46:29,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 131 conjunts are in the unsatisfiable core [2022-11-23 03:46:29,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:46:29,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:46:29,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:46:29,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:46:30,789 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 03:46:30,790 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-11-23 03:46:30,799 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-11-23 03:46:30,828 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-23 03:46:30,828 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-11-23 03:46:30,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 03:46:31,101 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-11-23 03:46:31,117 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-11-23 03:46:31,859 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-11-23 03:46:31,860 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-11-23 03:46:31,891 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-23 03:46:31,892 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-11-23 03:46:31,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 03:46:32,127 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-11-23 03:46:32,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:46:32,221 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-23 03:46:32,222 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-11-23 03:46:32,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:46:32,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:46:32,255 INFO L321 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-11-23 03:46:32,256 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-11-23 03:46:32,309 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-11-23 03:46:32,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-11-23 03:46:33,381 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-11-23 03:46:33,381 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-11-23 03:46:33,403 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-23 03:46:33,404 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-11-23 03:46:33,496 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-11-23 03:46:33,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:46:34,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774992507] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:46:34,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:46:34,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28] total 52 [2022-11-23 03:46:34,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914299889] [2022-11-23 03:46:34,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:46:34,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-23 03:46:34,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:46:34,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-23 03:46:34,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=3026, Unknown=3, NotChecked=110, Total=3306 [2022-11-23 03:46:34,475 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-11-23 03:46:43,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:46:43,293 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2022-11-23 03:46:43,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 03:46:43,294 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-11-23 03:46:43,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:46:43,295 INFO L225 Difference]: With dead ends: 105 [2022-11-23 03:46:43,295 INFO L226 Difference]: Without dead ends: 105 [2022-11-23 03:46:43,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1346 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=428, Invalid=5273, Unknown=3, NotChecked=148, Total=5852 [2022-11-23 03:46:43,297 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 163 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:46:43,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1201 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1359 Invalid, 0 Unknown, 91 Unchecked, 2.3s Time] [2022-11-23 03:46:43,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-23 03:46:43,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2022-11-23 03:46:43,301 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-11-23 03:46:43,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2022-11-23 03:46:43,302 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 53 [2022-11-23 03:46:43,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:46:43,303 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2022-11-23 03:46:43,303 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-11-23 03:46:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2022-11-23 03:46:43,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-23 03:46:43,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:46:43,305 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-11-23 03:46:43,315 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-23 03:46:43,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:46:43,513 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-11-23 03:46:43,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:46:43,513 INFO L85 PathProgramCache]: Analyzing trace with hash 729745886, now seen corresponding path program 1 times [2022-11-23 03:46:43,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:46:43,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900778032] [2022-11-23 03:46:43,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:46:43,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:46:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:44,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:46:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:44,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:46:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:45,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:46:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:46,118 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 03:46:46,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:46:46,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900778032] [2022-11-23 03:46:46,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900778032] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:46:46,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290277160] [2022-11-23 03:46:46,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:46:46,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:46:46,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:46:46,120 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:46:46,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-23 03:46:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:46,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 105 conjunts are in the unsatisfiable core [2022-11-23 03:46:46,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:46:46,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:46:46,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 03:46:46,567 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-11-23 03:46:46,588 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-11-23 03:46:46,618 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 03:46:46,618 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-11-23 03:46:46,963 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 03:46:46,963 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-11-23 03:46:46,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:46:47,190 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-23 03:46:47,191 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-11-23 03:46:47,423 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-11-23 03:46:48,011 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:46:48,012 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-11-23 03:46:48,022 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-11-23 03:46:48,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 03:46:48,414 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-11-23 03:46:48,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:46:48,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 03:46:48,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:46:48,503 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 03:46:48,503 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-11-23 03:46:48,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:46:48,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 03:46:48,526 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-23 03:46:48,527 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-11-23 03:46:48,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 03:46:49,142 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 15 not checked. [2022-11-23 03:46:49,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:46:50,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290277160] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:46:50,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:46:50,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 47 [2022-11-23 03:46:50,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035777447] [2022-11-23 03:46:50,647 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:46:50,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-23 03:46:50,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:46:50,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-23 03:46:50,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2724, Unknown=14, NotChecked=318, Total=3192 [2022-11-23 03:46:50,650 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-11-23 03:46:57,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:46:57,541 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2022-11-23 03:46:57,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 03:46:57,542 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-11-23 03:46:57,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:46:57,542 INFO L225 Difference]: With dead ends: 104 [2022-11-23 03:46:57,542 INFO L226 Difference]: Without dead ends: 104 [2022-11-23 03:46:57,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=467, Invalid=5079, Unknown=16, NotChecked=444, Total=6006 [2022-11-23 03:46:57,544 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 340 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 35 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 274 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:46:57,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 923 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1668 Invalid, 3 Unknown, 274 Unchecked, 2.1s Time] [2022-11-23 03:46:57,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-23 03:46:57,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2022-11-23 03:46:57,549 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-11-23 03:46:57,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2022-11-23 03:46:57,550 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 56 [2022-11-23 03:46:57,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:46:57,551 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2022-11-23 03:46:57,551 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-11-23 03:46:57,552 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-11-23 03:46:57,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-23 03:46:57,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:46:57,552 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-11-23 03:46:57,560 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-23 03:46:57,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-23 03:46:57,761 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-11-23 03:46:57,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:46:57,761 INFO L85 PathProgramCache]: Analyzing trace with hash 294390785, now seen corresponding path program 1 times [2022-11-23 03:46:57,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:46:57,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704755494] [2022-11-23 03:46:57,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:46:57,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:46:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:58,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:46:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:58,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:46:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:58,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:46:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 03:46:59,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:46:59,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704755494] [2022-11-23 03:46:59,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704755494] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:46:59,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854317142] [2022-11-23 03:46:59,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:46:59,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:46:59,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:46:59,195 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:46:59,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-23 03:46:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:46:59,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 87 conjunts are in the unsatisfiable core [2022-11-23 03:46:59,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:46:59,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:47:00,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:47:00,488 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:47:00,489 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-11-23 03:47:00,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 03:47:00,770 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-11-23 03:47:00,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:47:00,836 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 03:47:00,837 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-11-23 03:47:00,867 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-23 03:47:00,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-23 03:47:00,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:47:00,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 03:47:01,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 03:47:01,481 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-23 03:47:01,481 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-11-23 03:47:01,491 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-11-23 03:47:01,598 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:47:01,599 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-11-23 03:47:01,607 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-11-23 03:47:01,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:47:02,048 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_#t~mem9#1.base|) (+ |c_ULTIMATE.start_sll_append_#t~mem9#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-11-23 03:47:02,058 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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#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-11-23 03:47:02,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854317142] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:47:02,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:47:02,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 50 [2022-11-23 03:47:02,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778702146] [2022-11-23 03:47:02,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:47:02,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-23 03:47:02,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:47:02,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-23 03:47:02,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2618, Unknown=58, NotChecked=318, Total=3192 [2022-11-23 03:47:02,309 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-11-23 03:47:07,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:47:07,985 INFO L93 Difference]: Finished difference Result 176 states and 194 transitions. [2022-11-23 03:47:07,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-23 03:47:07,989 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-11-23 03:47:07,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:47:07,990 INFO L225 Difference]: With dead ends: 176 [2022-11-23 03:47:07,991 INFO L226 Difference]: Without dead ends: 176 [2022-11-23 03:47:07,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1523 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=884, Invalid=6207, Unknown=61, NotChecked=504, Total=7656 [2022-11-23 03:47:07,993 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 1298 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 46 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-23 03:47:07,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1298 Valid, 841 Invalid, 1646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1493 Invalid, 3 Unknown, 104 Unchecked, 1.6s Time] [2022-11-23 03:47:07,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-11-23 03:47:07,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 94. [2022-11-23 03:47:07,997 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-11-23 03:47:07,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2022-11-23 03:47:07,998 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 56 [2022-11-23 03:47:07,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:47:07,999 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2022-11-23 03:47:07,999 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-11-23 03:47:07,999 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2022-11-23 03:47:07,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-23 03:47:07,999 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:47:08,000 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-11-23 03:47:08,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-23 03:47:08,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-23 03:47:08,200 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-11-23 03:47:08,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:47:08,201 INFO L85 PathProgramCache]: Analyzing trace with hash 294390786, now seen corresponding path program 1 times [2022-11-23 03:47:08,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:47:08,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376224618] [2022-11-23 03:47:08,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:47:08,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:47:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:47:10,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:47:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:47:10,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:47:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:47:10,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:47:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:47:11,540 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 03:47:11,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:47:11,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376224618] [2022-11-23 03:47:11,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376224618] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:47:11,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235489520] [2022-11-23 03:47:11,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:47:11,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:47:11,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:47:11,543 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:47:11,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-23 03:47:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:47:11,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 105 conjunts are in the unsatisfiable core [2022-11-23 03:47:11,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:47:11,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:47:11,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 03:47:12,107 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 03:47:12,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 03:47:12,588 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-11-23 03:47:12,971 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:47:12,972 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-11-23 03:47:12,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 03:47:13,285 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-11-23 03:47:13,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:47:13,354 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 03:47:13,354 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-11-23 03:47:13,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:47:13,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 03:47:13,388 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-23 03:47:13,389 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-11-23 03:47:14,508 INFO L321 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2022-11-23 03:47:14,509 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-11-23 03:47:14,539 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-23 03:47:14,543 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-11-23 03:47:14,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:47:14,578 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-23 03:47:14,579 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-11-23 03:47:14,738 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:47:14,739 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-11-23 03:47:14,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-23 03:47:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-23 03:47:14,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:47:16,541 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:47:16,541 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-11-23 03:47:18,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235489520] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:47:18,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:47:18,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 60 [2022-11-23 03:47:18,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362812656] [2022-11-23 03:47:18,441 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:47:18,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-11-23 03:47:18,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:47:18,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-11-23 03:47:18,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=4812, Unknown=45, NotChecked=140, Total=5256 [2022-11-23 03:47:18,443 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-11-23 03:47:26,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:47:26,676 INFO L93 Difference]: Finished difference Result 162 states and 177 transitions. [2022-11-23 03:47:26,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-23 03:47:26,676 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-11-23 03:47:26,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:47:26,678 INFO L225 Difference]: With dead ends: 162 [2022-11-23 03:47:26,678 INFO L226 Difference]: Without dead ends: 162 [2022-11-23 03:47:26,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2598 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=977, Invalid=9694, Unknown=45, NotChecked=204, Total=10920 [2022-11-23 03:47:26,681 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1299 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 54 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-23 03:47:26,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 747 Invalid, 1848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1674 Invalid, 1 Unknown, 119 Unchecked, 1.8s Time] [2022-11-23 03:47:26,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-11-23 03:47:26,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 96. [2022-11-23 03:47:26,686 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-11-23 03:47:26,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2022-11-23 03:47:26,687 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 56 [2022-11-23 03:47:26,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:47:26,688 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2022-11-23 03:47:26,688 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-11-23 03:47:26,689 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2022-11-23 03:47:26,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-23 03:47:26,691 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:47:26,691 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-11-23 03:47:26,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-23 03:47:26,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-23 03:47:26,895 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-11-23 03:47:26,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:47:26,896 INFO L85 PathProgramCache]: Analyzing trace with hash 348951848, now seen corresponding path program 1 times [2022-11-23 03:47:26,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:47:26,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227440706] [2022-11-23 03:47:26,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:47:26,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:47:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:47:29,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:47:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:47:29,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:47:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:47:30,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:47:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:47:31,301 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 03:47:31,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:47:31,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227440706] [2022-11-23 03:47:31,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227440706] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:47:31,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681545279] [2022-11-23 03:47:31,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:47:31,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:47:31,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:47:31,303 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:47:31,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-23 03:47:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:47:31,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 128 conjunts are in the unsatisfiable core [2022-11-23 03:47:31,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:47:32,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 03:47:32,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 03:47:32,773 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 03:47:32,774 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-11-23 03:47:33,107 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-11-23 03:47:33,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:47:33,126 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-11-23 03:47:33,938 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:47:33,939 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-11-23 03:47:33,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 03:47:33,954 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-11-23 03:47:33,961 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-11-23 03:47:34,382 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-11-23 03:47:34,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:47:34,455 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 03:47:34,455 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-11-23 03:47:34,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:47:34,470 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-11-23 03:47:34,499 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-23 03:47:34,499 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-11-23 03:47:34,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:47:34,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 03:47:35,961 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-23 03:47:35,961 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-11-23 03:47:36,010 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-23 03:47:36,011 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-11-23 03:47:36,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:47:36,024 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-11-23 03:47:36,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:47:36,230 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-11-23 03:47:36,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 03:47:36,491 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-11-23 03:47:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-23 03:47:36,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:47:36,871 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-11-23 03:47:38,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681545279] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:47:38,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:47:38,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2022-11-23 03:47:38,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023960205] [2022-11-23 03:47:38,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:47:38,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-23 03:47:38,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:47:38,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-23 03:47:38,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=5295, Unknown=3, NotChecked=294, Total=5852 [2022-11-23 03:47:38,587 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-11-23 03:47:53,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:47:53,735 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2022-11-23 03:47:53,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-23 03:47:53,735 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-11-23 03:47:53,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:47:53,736 INFO L225 Difference]: With dead ends: 157 [2022-11-23 03:47:53,736 INFO L226 Difference]: Without dead ends: 157 [2022-11-23 03:47:53,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2613 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=1115, Invalid=10662, Unknown=3, NotChecked=430, Total=12210 [2022-11-23 03:47:53,738 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1280 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 2052 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 2192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2052 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-23 03:47:53,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 1063 Invalid, 2192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2052 Invalid, 1 Unknown, 79 Unchecked, 2.5s Time] [2022-11-23 03:47:53,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-23 03:47:53,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 106. [2022-11-23 03:47:53,742 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-11-23 03:47:53,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2022-11-23 03:47:53,743 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 60 [2022-11-23 03:47:53,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:47:53,744 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2022-11-23 03:47:53,744 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-11-23 03:47:53,744 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2022-11-23 03:47:53,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-23 03:47:53,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:47:53,745 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-11-23 03:47:53,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-23 03:47:53,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:47:53,960 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-11-23 03:47:53,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:47:53,961 INFO L85 PathProgramCache]: Analyzing trace with hash -2067394117, now seen corresponding path program 1 times [2022-11-23 03:47:53,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:47:53,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517185372] [2022-11-23 03:47:53,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:47:53,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:47:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:47:56,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:47:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:47:57,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:47:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:47:57,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:47:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:47:58,350 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 03:47:58,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:47:58,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517185372] [2022-11-23 03:47:58,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517185372] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:47:58,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577273110] [2022-11-23 03:47:58,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:47:58,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:47:58,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:47:58,360 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:47:58,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-23 03:47:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:47:58,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-23 03:47:58,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:47:58,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:47:58,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:47:58,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 03:47:58,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 03:47:59,202 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 03:47:59,202 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-11-23 03:47:59,221 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 03:47:59,222 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-11-23 03:47:59,698 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-11-23 03:48:00,093 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 03:48:00,094 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-11-23 03:48:00,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:48:00,122 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-11-23 03:48:00,442 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-11-23 03:48:01,299 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:48:01,300 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-11-23 03:48:01,311 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-11-23 03:48:01,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 03:48:01,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 03:48:01,780 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-11-23 03:48:01,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:48:01,867 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 03:48:01,867 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-11-23 03:48:01,927 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2022-11-23 03:48:01,927 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-11-23 03:48:01,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:48:01,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 03:48:01,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:48:01,952 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-11-23 03:48:02,849 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:48:02,851 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-11-23 03:48:03,477 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-11-23 03:48:03,477 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-11-23 03:48:03,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-23 03:48:03,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 03:48:04,366 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:48:04,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:48:04,370 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:48:04,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 49 [2022-11-23 03:48:05,109 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2022-11-23 03:48:05,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:48:08,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577273110] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:48:08,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:48:08,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 31] total 67 [2022-11-23 03:48:08,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950223175] [2022-11-23 03:48:08,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:48:08,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-23 03:48:08,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:48:08,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-23 03:48:08,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=5006, Unknown=2, NotChecked=142, Total=5402 [2022-11-23 03:48:08,541 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-11-23 03:48:34,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:48:34,607 INFO L93 Difference]: Finished difference Result 170 states and 182 transitions. [2022-11-23 03:48:34,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-23 03:48:34,608 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-11-23 03:48:34,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:48:34,609 INFO L225 Difference]: With dead ends: 170 [2022-11-23 03:48:34,609 INFO L226 Difference]: Without dead ends: 170 [2022-11-23 03:48:34,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2899 ImplicationChecksByTransitivity, 31.4s TimeCoverageRelationStatistics Valid=1480, Invalid=11402, Unknown=4, NotChecked=224, Total=13110 [2022-11-23 03:48:34,612 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1679 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 2096 mSolverCounterSat, 70 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1679 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 2296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2096 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-23 03:48:34,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1679 Valid, 868 Invalid, 2296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2096 Invalid, 3 Unknown, 127 Unchecked, 3.4s Time] [2022-11-23 03:48:34,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-23 03:48:34,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 109. [2022-11-23 03:48:34,617 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-11-23 03:48:34,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2022-11-23 03:48:34,618 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 61 [2022-11-23 03:48:34,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:48:34,619 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2022-11-23 03:48:34,620 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-11-23 03:48:34,620 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2022-11-23 03:48:34,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-23 03:48:34,621 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:48:34,621 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-11-23 03:48:34,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-23 03:48:34,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-23 03:48:34,829 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-11-23 03:48:34,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:48:34,830 INFO L85 PathProgramCache]: Analyzing trace with hash -2067394116, now seen corresponding path program 1 times [2022-11-23 03:48:34,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:48:34,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598083543] [2022-11-23 03:48:34,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:48:34,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:48:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:48:37,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:48:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:48:37,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:48:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:48:37,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:48:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:48:38,803 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 03:48:38,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:48:38,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598083543] [2022-11-23 03:48:38,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598083543] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:48:38,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354242512] [2022-11-23 03:48:38,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:48:38,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:48:38,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:48:38,805 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:48:38,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-23 03:48:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:48:39,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 133 conjunts are in the unsatisfiable core [2022-11-23 03:48:39,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:48:39,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:48:39,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:48:39,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 03:48:39,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-11-23 03:48:39,814 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 03:48:39,814 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-11-23 03:48:39,857 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 03:48:39,858 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-11-23 03:48:40,507 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 03:48:40,507 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-11-23 03:48:40,513 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-11-23 03:48:40,888 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-23 03:48:40,888 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-11-23 03:48:40,914 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 03:48:40,915 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-11-23 03:48:41,337 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-11-23 03:48:41,354 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-11-23 03:48:42,370 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:48:42,370 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-11-23 03:48:42,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:48:42,382 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-11-23 03:48:42,398 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 03:48:42,399 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-11-23 03:48:42,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 03:48:42,888 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-11-23 03:48:42,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:48:42,982 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 03:48:42,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 84 [2022-11-23 03:48:43,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:48:43,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:48:43,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-23 03:48:43,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:48:43,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:48:43,025 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-23 03:48:43,026 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-11-23 03:48:43,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:48:43,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:48:43,066 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-23 03:48:43,066 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-11-23 03:48:44,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:48:44,518 INFO L321 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-11-23 03:48:44,518 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-11-23 03:48:44,583 INFO L321 Elim1Store]: treesize reduction 65, result has 30.1 percent of original size [2022-11-23 03:48:44,583 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-11-23 03:48:45,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:48:45,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:48:45,539 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:48:45,540 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-11-23 03:48:45,558 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-23 03:48:45,558 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-11-23 03:48:46,408 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2022-11-23 03:48:46,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:48:52,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354242512] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:48:52,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:48:52,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 30] total 66 [2022-11-23 03:48:52,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595016648] [2022-11-23 03:48:52,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:48:52,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-23 03:48:52,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:48:52,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-23 03:48:52,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=5580, Unknown=13, NotChecked=150, Total=6006 [2022-11-23 03:48:52,363 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-11-23 03:49:19,700 WARN L233 SmtUtils]: Spent 5.06s on a formula simplification. DAG size of input: 217 DAG size of output: 192 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:49:27,333 WARN L233 SmtUtils]: Spent 7.23s on a formula simplification. DAG size of input: 197 DAG size of output: 173 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:49:56,097 WARN L233 SmtUtils]: Spent 7.14s 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-11-23 03:49:59,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:49:59,653 INFO L93 Difference]: Finished difference Result 174 states and 189 transitions. [2022-11-23 03:49:59,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-23 03:49:59,653 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-11-23 03:49:59,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:49:59,656 INFO L225 Difference]: With dead ends: 174 [2022-11-23 03:49:59,656 INFO L226 Difference]: Without dead ends: 174 [2022-11-23 03:49:59,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2552 ImplicationChecksByTransitivity, 73.4s TimeCoverageRelationStatistics Valid=1381, Invalid=12179, Unknown=16, NotChecked=230, Total=13806 [2022-11-23 03:49:59,659 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1381 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 50 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1381 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 2568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:49:59,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1381 Valid, 983 Invalid, 2568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2392 Invalid, 3 Unknown, 123 Unchecked, 5.2s Time] [2022-11-23 03:49:59,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-11-23 03:49:59,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 111. [2022-11-23 03:49:59,664 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-11-23 03:49:59,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2022-11-23 03:49:59,669 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 61 [2022-11-23 03:49:59,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:49:59,670 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2022-11-23 03:49:59,670 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-11-23 03:49:59,670 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2022-11-23 03:49:59,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-23 03:49:59,671 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:49:59,671 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-11-23 03:49:59,679 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-23 03:49:59,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-23 03:49:59,872 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-11-23 03:49:59,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:49:59,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1413927454, now seen corresponding path program 1 times [2022-11-23 03:49:59,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:49:59,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273352478] [2022-11-23 03:49:59,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:49:59,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:49:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:03,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:50:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:03,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:50:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:04,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:50:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:05,702 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 03:50:05,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:50:05,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273352478] [2022-11-23 03:50:05,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273352478] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:50:05,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600004058] [2022-11-23 03:50:05,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:05,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:50:05,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:50:05,705 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:50:05,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-23 03:50:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:06,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 173 conjunts are in the unsatisfiable core [2022-11-23 03:50:06,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:50:06,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:50:06,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 03:50:06,508 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-11-23 03:50:06,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:50:06,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 03:50:07,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:50:07,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-23 03:50:07,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 03:50:07,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-11-23 03:50:07,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 03:50:08,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:50:08,534 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-11-23 03:50:08,570 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 03:50:08,570 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-11-23 03:50:08,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 03:50:08,614 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 03:50:08,615 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-11-23 03:50:09,068 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-11-23 03:50:09,082 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-11-23 03:50:09,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:50:10,300 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:50:10,300 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-11-23 03:50:10,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:50:10,315 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-11-23 03:50:10,322 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-11-23 03:50:10,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 03:50:10,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 03:50:10,829 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-11-23 03:50:10,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:50:10,952 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 03:50:10,953 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-11-23 03:50:10,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:50:10,978 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-11-23 03:50:11,014 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-23 03:50:11,015 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-11-23 03:50:11,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:50:11,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:50:11,027 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-11-23 03:50:11,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:50:11,045 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-11-23 03:50:12,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:50:12,789 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-11-23 03:50:13,440 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-11-23 03:50:13,440 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-11-23 03:50:13,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:50:13,516 INFO L321 Elim1Store]: treesize reduction 112, result has 16.4 percent of original size [2022-11-23 03:50:13,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 172 treesize of output 116 [2022-11-23 03:50:13,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:50:13,531 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-11-23 03:50:14,539 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:50:14,540 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:50:14,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:50:14,552 INFO L321 Elim1Store]: treesize reduction 3, result has 70.0 percent of original size [2022-11-23 03:50:14,552 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-11-23 03:50:14,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:50:14,570 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-23 03:50:14,570 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-11-23 03:50:15,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:50:15,235 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:50:15,235 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-11-23 03:50:15,386 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-23 03:50:15,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:50:23,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600004058] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:50:23,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:50:23,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 77 [2022-11-23 03:50:23,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600438020] [2022-11-23 03:50:23,094 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:50:23,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-23 03:50:23,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:50:23,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-23 03:50:23,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=7870, Unknown=51, NotChecked=178, Total=8372 [2022-11-23 03:50:23,096 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-11-23 03:50:57,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:50:57,478 INFO L93 Difference]: Finished difference Result 167 states and 183 transitions. [2022-11-23 03:50:57,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-23 03:50:57,479 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-11-23 03:50:57,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:50:57,480 INFO L225 Difference]: With dead ends: 167 [2022-11-23 03:50:57,480 INFO L226 Difference]: Without dead ends: 167 [2022-11-23 03:50:57,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 124 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2006 ImplicationChecksByTransitivity, 44.7s TimeCoverageRelationStatistics Valid=1217, Invalid=14230, Unknown=57, NotChecked=246, Total=15750 [2022-11-23 03:50:57,482 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1362 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 3732 mSolverCounterSat, 74 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1362 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 3926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 3732 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-11-23 03:50:57,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1362 Valid, 1418 Invalid, 3926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 3732 Invalid, 5 Unknown, 115 Unchecked, 6.5s Time] [2022-11-23 03:50:57,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-23 03:50:57,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 116. [2022-11-23 03:50:57,487 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-11-23 03:50:57,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2022-11-23 03:50:57,489 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 65 [2022-11-23 03:50:57,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:50:57,489 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2022-11-23 03:50:57,490 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-11-23 03:50:57,490 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2022-11-23 03:50:57,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-23 03:50:57,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:50:57,491 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-11-23 03:50:57,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-23 03:50:57,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-23 03:50:57,699 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-11-23 03:50:57,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:50:57,699 INFO L85 PathProgramCache]: Analyzing trace with hash -655878667, now seen corresponding path program 3 times [2022-11-23 03:50:57,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:50:57,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693744399] [2022-11-23 03:50:57,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:57,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:50:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:57,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:50:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:57,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:50:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:57,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-23 03:50:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:57,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-23 03:50:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:57,874 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-23 03:50:57,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:50:57,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693744399] [2022-11-23 03:50:57,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693744399] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:50:57,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333009414] [2022-11-23 03:50:57,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 03:50:57,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:50:57,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:50:57,877 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:50:57,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-23 03:50:58,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-23 03:50:58,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:50:58,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 03:50:58,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:50:58,827 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-23 03:50:58,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:50:58,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333009414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:50:58,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 03:50:58,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-11-23 03:50:58,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516869604] [2022-11-23 03:50:58,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:50:58,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:50:58,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:50:58,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:50:58,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:50:58,830 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-11-23 03:50:58,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:50:58,851 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-11-23 03:50:58,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:50:58,860 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-11-23 03:50:58,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:50:58,861 INFO L225 Difference]: With dead ends: 77 [2022-11-23 03:50:58,861 INFO L226 Difference]: Without dead ends: 77 [2022-11-23 03:50:58,861 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-11-23 03:50:58,862 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 138 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:50:58,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 81 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:50:58,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-23 03:50:58,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-11-23 03:50:58,867 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-11-23 03:50:58,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2022-11-23 03:50:58,868 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 66 [2022-11-23 03:50:58,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:50:58,869 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2022-11-23 03:50:58,869 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-11-23 03:50:58,869 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-11-23 03:50:58,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-23 03:50:58,870 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:50:58,870 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-11-23 03:50:58,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-23 03:50:59,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-23 03:50:59,079 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-11-23 03:50:59,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:50:59,080 INFO L85 PathProgramCache]: Analyzing trace with hash -882077631, now seen corresponding path program 2 times [2022-11-23 03:50:59,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:50:59,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714152785] [2022-11-23 03:50:59,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:59,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:50:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:51:03,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:51:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:51:03,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:51:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:51:04,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:51:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:51:05,239 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 03:51:05,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:51:05,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714152785] [2022-11-23 03:51:05,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714152785] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:51:05,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801487162] [2022-11-23 03:51:05,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 03:51:05,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:51:05,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:51:05,241 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:51:05,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-23 03:51:05,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 03:51:05,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:51:05,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 159 conjunts are in the unsatisfiable core [2022-11-23 03:51:05,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:51:05,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 03:51:05,930 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 03:51:05,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 03:51:06,277 INFO L321 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2022-11-23 03:51:06,277 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-11-23 03:51:06,769 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-23 03:51:06,769 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-11-23 03:51:06,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:51:07,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:51:07,116 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-11-23 03:51:07,347 INFO L321 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2022-11-23 03:51:07,348 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-11-23 03:51:07,761 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-11-23 03:51:08,639 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:51:08,639 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-11-23 03:51:08,647 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-11-23 03:51:08,689 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-23 03:51:08,689 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-11-23 03:51:09,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:51:09,609 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 03:51:09,609 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-11-23 03:51:09,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:51:09,676 INFO L321 Elim1Store]: treesize reduction 108, result has 28.5 percent of original size [2022-11-23 03:51:09,676 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-11-23 03:51:09,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:51:09,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 03:51:11,817 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:51:11,856 INFO L321 Elim1Store]: treesize reduction 97, result has 19.8 percent of original size [2022-11-23 03:51:11,858 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-11-23 03:51:11,888 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-23 03:51:11,888 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-11-23 03:51:12,998 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-23 03:51:12,999 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-11-23 03:51:14,331 INFO L321 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2022-11-23 03:51:14,331 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-11-23 03:51:15,250 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 03:51:15,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:51:19,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801487162] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:51:19,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:51:19,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 37] total 80 [2022-11-23 03:51:19,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519509346] [2022-11-23 03:51:19,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:51:19,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-11-23 03:51:19,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:51:19,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-11-23 03:51:19,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=8818, Unknown=2, NotChecked=0, Total=9120 [2022-11-23 03:51:19,027 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-11-23 03:51:52,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:51:52,192 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2022-11-23 03:51:52,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-23 03:51:52,193 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-11-23 03:51:52,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:51:52,194 INFO L225 Difference]: With dead ends: 100 [2022-11-23 03:51:52,194 INFO L226 Difference]: Without dead ends: 100 [2022-11-23 03:51:52,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3358 ImplicationChecksByTransitivity, 38.6s TimeCoverageRelationStatistics Valid=1389, Invalid=15900, Unknown=3, NotChecked=0, Total=17292 [2022-11-23 03:51:52,196 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 1145 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 3108 mSolverCounterSat, 58 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 3168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 3108 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-11-23 03:51:52,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 1029 Invalid, 3168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 3108 Invalid, 2 Unknown, 0 Unchecked, 7.8s Time] [2022-11-23 03:51:52,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-23 03:51:52,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2022-11-23 03:51:52,199 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-11-23 03:51:52,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2022-11-23 03:51:52,200 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 66 [2022-11-23 03:51:52,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:51:52,200 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2022-11-23 03:51:52,201 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-11-23 03:51:52,201 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-11-23 03:51:52,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-23 03:51:52,202 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:51:52,202 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-11-23 03:51:52,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-23 03:51:52,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-23 03:51:52,407 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-11-23 03:51:52,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:51:52,408 INFO L85 PathProgramCache]: Analyzing trace with hash -882077630, now seen corresponding path program 2 times [2022-11-23 03:51:52,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:51:52,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616521587] [2022-11-23 03:51:52,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:51:52,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:51:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:51:56,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:51:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:51:57,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:51:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:51:57,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:51:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:51:58,705 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 03:51:58,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:51:58,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616521587] [2022-11-23 03:51:58,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616521587] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:51:58,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238554691] [2022-11-23 03:51:58,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 03:51:58,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:51:58,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:51:58,707 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:51:58,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-23 03:51:59,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 03:51:59,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:51:59,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 204 conjunts are in the unsatisfiable core [2022-11-23 03:51:59,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:51:59,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:51:59,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:51:59,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 03:51:59,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 03:51:59,692 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 03:51:59,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 03:51:59,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 03:52:00,285 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-11-23 03:52:00,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:52:00,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:52:00,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:52:00,629 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-11-23 03:52:00,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:52:00,654 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-11-23 03:52:00,877 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 03:52:00,877 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-11-23 03:52:00,921 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 03:52:00,922 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-11-23 03:52:01,342 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-11-23 03:52:01,369 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-11-23 03:52:02,364 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-11-23 03:52:02,373 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:52:02,374 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-11-23 03:52:02,382 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-11-23 03:52:02,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:52:02,392 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-11-23 03:52:03,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:52:03,387 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 03:52:03,387 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-11-23 03:52:03,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:52:03,404 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-11-23 03:52:03,433 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-23 03:52:03,433 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-11-23 03:52:03,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:52:03,450 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-23 03:52:03,450 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-11-23 03:52:05,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:52:05,945 INFO L321 Elim1Store]: treesize reduction 96, result has 17.9 percent of original size [2022-11-23 03:52:05,946 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-11-23 03:52:06,000 INFO L321 Elim1Store]: treesize reduction 128, result has 14.7 percent of original size [2022-11-23 03:52:06,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 229 treesize of output 141 [2022-11-23 03:52:10,674 INFO L321 Elim1Store]: treesize reduction 184, result has 59.7 percent of original size [2022-11-23 03:52:10,675 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-11-23 03:52:11,529 INFO L321 Elim1Store]: treesize reduction 152, result has 60.1 percent of original size [2022-11-23 03:52:11,530 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-11-23 03:52:30,884 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 03:52:30,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:52:44,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238554691] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:52:44,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:52:44,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42] total 82 [2022-11-23 03:52:44,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484491762] [2022-11-23 03:52:44,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:52:44,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-11-23 03:52:44,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:52:44,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-11-23 03:52:44,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=10391, Unknown=0, NotChecked=0, Total=10712 [2022-11-23 03:52:44,676 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-11-23 03:53:20,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:53:20,333 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-11-23 03:53:20,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-23 03:53:20,334 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-11-23 03:53:20,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:53:20,334 INFO L225 Difference]: With dead ends: 96 [2022-11-23 03:53:20,335 INFO L226 Difference]: Without dead ends: 96 [2022-11-23 03:53:20,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4185 ImplicationChecksByTransitivity, 51.7s TimeCoverageRelationStatistics Valid=1282, Invalid=18740, Unknown=0, NotChecked=0, Total=20022 [2022-11-23 03:53:20,338 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 879 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 3479 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 3522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-11-23 03:53:20,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 1139 Invalid, 3522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3479 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2022-11-23 03:53:20,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-23 03:53:20,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 81. [2022-11-23 03:53:20,342 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-11-23 03:53:20,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2022-11-23 03:53:20,342 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 66 [2022-11-23 03:53:20,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:53:20,343 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2022-11-23 03:53:20,343 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-11-23 03:53:20,344 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-11-23 03:53:20,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-23 03:53:20,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:53:20,345 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-11-23 03:53:20,355 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-11-23 03:53:20,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:53:20,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-11-23 03:53:20,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:53:20,552 INFO L85 PathProgramCache]: Analyzing trace with hash 642840936, now seen corresponding path program 2 times [2022-11-23 03:53:20,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:53:20,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073308686] [2022-11-23 03:53:20,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:53:20,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:53:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:53:23,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:53:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:53:23,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:53:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:53:24,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:53:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:53:25,131 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 5 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 03:53:25,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:53:25,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073308686] [2022-11-23 03:53:25,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073308686] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:53:25,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408320620] [2022-11-23 03:53:25,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 03:53:25,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:53:25,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:53:25,133 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:53:25,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-23 03:53:25,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 03:53:25,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:53:25,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 209 conjunts are in the unsatisfiable core [2022-11-23 03:53:25,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:53:25,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:53:25,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 03:53:25,924 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-11-23 03:53:25,927 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-11-23 03:53:25,973 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-11-23 03:53:25,977 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-11-23 03:53:26,057 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-11-23 03:53:26,061 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-11-23 03:53:26,166 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-11-23 03:53:26,170 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-11-23 03:53:26,215 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-11-23 03:53:26,219 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-11-23 03:53:26,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:53:26,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:53:26,307 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-11-23 03:53:26,310 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-11-23 03:53:26,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:53:26,323 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-11-23 03:53:26,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:53:26,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 21 treesize of output 20 [2022-11-23 03:53:26,417 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-11-23 03:53:26,420 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-11-23 03:53:26,602 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-11-23 03:53:26,607 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-11-23 03:53:26,714 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-11-23 03:53:26,719 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-11-23 03:53:26,739 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:53:26,740 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-11-23 03:53:26,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:53:26,781 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-11-23 03:53:26,836 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-11-23 03:53:26,841 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-11-23 03:53:26,943 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-11-23 03:53:26,948 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-11-23 03:53:27,232 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-11-23 03:53:27,237 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-11-23 03:53:27,361 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-11-23 03:53:27,366 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-11-23 03:53:27,415 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:53:27,415 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-11-23 03:53:27,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:53:27,427 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-11-23 03:53:27,473 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-11-23 03:53:27,478 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-11-23 03:53:27,573 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-11-23 03:53:27,578 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-11-23 03:53:27,755 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-11-23 03:53:27,760 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-11-23 03:53:27,827 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-11-23 03:53:27,864 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-11-23 03:53:27,869 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-11-23 03:53:27,972 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-11-23 03:53:27,977 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-11-23 03:53:28,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:53:28,162 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 03:53:28,162 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-11-23 03:53:28,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:53:28,198 INFO L321 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2022-11-23 03:53:28,198 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-11-23 03:53:28,376 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-11-23 03:53:28,382 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-11-23 03:53:28,636 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-11-23 03:53:28,644 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-11-23 03:53:29,202 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-11-23 03:53:29,209 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-11-23 03:53:29,438 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-11-23 03:53:29,445 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-11-23 03:53:30,026 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-11-23 03:53:30,033 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-11-23 03:53:30,293 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-11-23 03:53:30,300 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-11-23 03:53:30,610 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-11-23 03:53:30,617 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-11-23 03:53:30,908 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-11-23 03:53:30,914 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-11-23 03:53:30,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:53:30,974 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:53:31,069 INFO L321 Elim1Store]: treesize reduction 139, result has 14.7 percent of original size [2022-11-23 03:53:31,069 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-11-23 03:53:31,198 INFO L321 Elim1Store]: treesize reduction 128, result has 14.7 percent of original size [2022-11-23 03:53:31,198 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-11-23 03:53:31,338 INFO L321 Elim1Store]: treesize reduction 63, result has 49.2 percent of original size [2022-11-23 03:53:31,339 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-11-23 03:53:31,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 03:53:31,495 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-11-23 03:53:31,501 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-11-23 03:53:32,717 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-11-23 03:53:32,724 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-11-23 03:53:33,114 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-11-23 03:53:33,121 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-11-23 03:53:33,753 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-11-23 03:53:33,760 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-11-23 03:53:34,151 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-11-23 03:53:34,157 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-11-23 03:53:34,599 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-11-23 03:53:34,606 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-11-23 03:53:35,051 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-11-23 03:53:35,058 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-11-23 03:53:35,470 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-11-23 03:53:35,477 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-11-23 03:53:35,542 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:53:35,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:53:35,594 INFO L321 Elim1Store]: treesize reduction 95, result has 6.9 percent of original size [2022-11-23 03:53:35,594 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-11-23 03:53:35,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:53:35,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:53:35,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:53:35,659 INFO L321 Elim1Store]: treesize reduction 12, result has 36.8 percent of original size [2022-11-23 03:53:35,659 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-11-23 03:53:35,815 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-11-23 03:53:35,821 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-11-23 03:53:36,047 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-11-23 03:53:36,053 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-11-23 03:53:36,241 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-11-23 03:53:36,247 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-11-23 03:53:36,482 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-11-23 03:53:36,488 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-11-23 03:53:36,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 03:53:36,966 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 46 not checked. [2022-11-23 03:53:36,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:53:41,180 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:53:41,180 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-11-23 03:53:41,237 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:53:41,237 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-11-23 03:53:41,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1290 treesize of output 659 [2022-11-23 03:54:14,600 WARN L233 SmtUtils]: Spent 15.18s 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-11-23 03:54:14,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408320620] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:54:14,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:54:14,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 45] total 85 [2022-11-23 03:54:14,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248849474] [2022-11-23 03:54:14,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:54:14,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-11-23 03:54:14,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:54:14,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-11-23 03:54:14,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=4104, Unknown=76, NotChecked=6270, Total=10712 [2022-11-23 03:54:14,609 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-11-23 03:54:18,955 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-11-23 03:54:18,960 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-11-23 03:54:18,966 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-11-23 03:54:18,971 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-11-23 03:54:18,977 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-11-23 03:54:18,981 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-11-23 03:54:18,989 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-11-23 03:54:18,993 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-11-23 03:54:19,000 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-11-23 03:54:19,005 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-11-23 03:54:19,015 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-11-23 03:54:19,020 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-11-23 03:54:19,028 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-11-23 03:54:19,033 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-11-23 03:54:19,052 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-11-23 03:54:19,062 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-11-23 03:54:19,079 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-11-23 03:54:19,085 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-11-23 03:54:19,113 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-11-23 03:54:19,119 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-11-23 03:54:19,138 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-11-23 03:54:19,145 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-11-23 03:54:19,157 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-11-23 03:54:19,164 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-11-23 03:54:19,183 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-11-23 03:54:19,190 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-11-23 03:54:19,207 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-11-23 03:54:19,214 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-11-23 03:54:19,238 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-11-23 03:54:19,244 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-11-23 03:54:19,269 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-11-23 03:54:19,277 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-11-23 03:54:19,317 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-11-23 03:54:19,325 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-11-23 03:54:19,354 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-11-23 03:54:19,362 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-11-23 03:54:19,448 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-11-23 03:54:19,465 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-11-23 03:54:19,559 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-11-23 03:54:19,567 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-11-23 03:54:19,635 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-11-23 03:54:19,644 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-11-23 03:54:19,709 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-11-23 03:54:19,718 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-11-23 03:54:19,835 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-11-23 03:54:19,843 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-11-23 03:54:19,896 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-11-23 03:54:19,905 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-11-23 03:54:20,008 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-11-23 03:54:20,016 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-11-23 03:54:20,083 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-11-23 03:54:20,092 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-11-23 03:54:20,144 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-11-23 03:54:20,153 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-11-23 03:54:20,215 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-11-23 03:54:20,225 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-11-23 03:54:20,349 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-11-23 03:54:20,358 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-11-23 03:54:20,471 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-11-23 03:54:20,480 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-11-23 03:54:20,549 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-11-23 03:54:20,557 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-11-23 03:54:20,658 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-11-23 03:54:20,666 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-11-23 03:54:20,819 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-11-23 03:54:20,829 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-11-23 03:54:20,909 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-11-23 03:54:20,918 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-11-23 03:54:20,994 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-11-23 03:54:21,003 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-11-23 03:54:21,110 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-11-23 03:54:21,118 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-11-23 03:54:21,164 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-11-23 03:54:21,171 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-11-23 03:54:21,224 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-11-23 03:54:21,232 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-11-23 03:54:21,321 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-11-23 03:54:21,329 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-11-23 03:54:21,370 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-11-23 03:54:21,378 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-11-23 03:54:21,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:54:21,778 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2022-11-23 03:54:21,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-11-23 03:54:21,779 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-11-23 03:54:21,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:54:21,780 INFO L225 Difference]: With dead ends: 96 [2022-11-23 03:54:21,781 INFO L226 Difference]: Without dead ends: 96 [2022-11-23 03:54:21,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 146 ConstructedPredicates, 78 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 47.0s TimeCoverageRelationStatistics Valid=380, Invalid=4606, Unknown=156, NotChecked=16614, Total=21756 [2022-11-23 03:54:21,784 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1425 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-23 03:54:21,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 767 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 497 Invalid, 0 Unknown, 1425 Unchecked, 0.9s Time] [2022-11-23 03:54:21,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-23 03:54:21,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-11-23 03:54:21,788 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-11-23 03:54:21,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2022-11-23 03:54:21,789 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 70 [2022-11-23 03:54:21,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:54:21,789 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2022-11-23 03:54:21,790 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-11-23 03:54:21,790 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2022-11-23 03:54:21,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-23 03:54:21,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:54:21,791 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-11-23 03:54:21,800 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-23 03:54:21,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-23 03:54:22,000 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-11-23 03:54:22,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:54:22,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1546766981, now seen corresponding path program 3 times [2022-11-23 03:54:22,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:54:22,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315636809] [2022-11-23 03:54:22,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:54:22,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:54:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:54:27,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:54:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:54:27,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:54:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:54:28,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:54:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:54:29,766 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 44 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 03:54:29,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:54:29,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315636809] [2022-11-23 03:54:29,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315636809] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:54:29,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838432485] [2022-11-23 03:54:29,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 03:54:29,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:54:29,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:54:29,769 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:54:29,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-23 03:54:30,603 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-23 03:54:30,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:54:30,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 200 conjunts are in the unsatisfiable core [2022-11-23 03:54:30,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:54:30,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:54:30,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 03:54:31,275 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 03:54:31,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 03:54:32,529 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-23 03:54:32,529 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-11-23 03:54:33,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:54:33,036 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-11-23 03:54:34,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:54:34,272 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:54:34,273 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-11-23 03:54:34,288 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-23 03:54:34,288 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-11-23 03:54:35,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:54:35,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:54:35,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:54:35,619 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-11-23 03:54:35,620 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-11-23 03:54:35,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:54:35,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:54:35,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:54:35,644 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-23 03:54:35,644 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-11-23 03:54:35,713 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-11-23 03:54:35,714 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-11-23 03:54:39,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:54:39,357 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:54:39,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:54:39,439 INFO L321 Elim1Store]: treesize reduction 98, result has 22.2 percent of original size [2022-11-23 03:54:39,440 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-11-23 03:54:39,530 INFO L321 Elim1Store]: treesize reduction 156, result has 14.3 percent of original size [2022-11-23 03:54:39,530 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-11-23 03:54:44,730 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:54:44,800 INFO L321 Elim1Store]: treesize reduction 132, result has 7.7 percent of original size [2022-11-23 03:54:44,800 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-11-23 03:54:44,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:54:44,840 INFO L321 Elim1Store]: treesize reduction 22, result has 24.1 percent of original size [2022-11-23 03:54:44,841 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-11-23 03:54:44,881 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 17 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 03:54:44,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:54:57,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838432485] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:54:57,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:54:57,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 46] total 82 [2022-11-23 03:54:57,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885412427] [2022-11-23 03:54:57,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:54:57,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-11-23 03:54:57,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:54:57,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-11-23 03:54:57,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=10378, Unknown=0, NotChecked=0, Total=10712 [2022-11-23 03:54:57,720 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-11-23 03:55:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:55:23,946 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2022-11-23 03:55:23,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-23 03:55:23,947 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-11-23 03:55:23,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:55:23,948 INFO L225 Difference]: With dead ends: 101 [2022-11-23 03:55:23,949 INFO L226 Difference]: Without dead ends: 101 [2022-11-23 03:55:23,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4200 ImplicationChecksByTransitivity, 47.7s TimeCoverageRelationStatistics Valid=1215, Invalid=18245, Unknown=0, NotChecked=0, Total=19460 [2022-11-23 03:55:23,952 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 825 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 2295 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 2334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:55:23,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 856 Invalid, 2334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2295 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-11-23 03:55:23,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-23 03:55:23,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2022-11-23 03:55:23,960 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-11-23 03:55:23,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2022-11-23 03:55:23,961 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 71 [2022-11-23 03:55:23,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:55:23,963 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2022-11-23 03:55:23,963 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-11-23 03:55:23,964 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2022-11-23 03:55:23,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-23 03:55:23,970 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:55:23,970 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-11-23 03:55:23,990 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-11-23 03:55:24,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:55:24,185 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-11-23 03:55:24,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:55:24,186 INFO L85 PathProgramCache]: Analyzing trace with hash -705137454, now seen corresponding path program 1 times [2022-11-23 03:55:24,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:55:24,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237016022] [2022-11-23 03:55:24,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:55:24,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:55:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:24,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:55:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:24,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:55:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:24,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:55:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:24,559 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-23 03:55:24,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:55:24,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237016022] [2022-11-23 03:55:24,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237016022] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:55:24,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175893180] [2022-11-23 03:55:24,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:55:24,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:55:24,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:55:24,561 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:55:24,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-23 03:55:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:25,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-23 03:55:25,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:55:25,582 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-23 03:55:25,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:55:26,010 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-23 03:55:26,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175893180] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:55:26,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:55:26,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2022-11-23 03:55:26,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375889952] [2022-11-23 03:55:26,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:55:26,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 03:55:26,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:55:26,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 03:55:26,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-23 03:55:26,012 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-11-23 03:55:26,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:55:26,244 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2022-11-23 03:55:26,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 03:55:26,245 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-11-23 03:55:26,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:55:26,246 INFO L225 Difference]: With dead ends: 87 [2022-11-23 03:55:26,246 INFO L226 Difference]: Without dead ends: 87 [2022-11-23 03:55:26,247 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-11-23 03:55:26,247 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 68 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 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-11-23 03:55:26,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 389 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 03:55:26,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-23 03:55:26,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-11-23 03:55:26,251 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-11-23 03:55:26,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2022-11-23 03:55:26,251 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 72 [2022-11-23 03:55:26,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:55:26,252 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2022-11-23 03:55:26,252 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-11-23 03:55:26,252 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2022-11-23 03:55:26,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-23 03:55:26,253 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:55:26,254 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-11-23 03:55:26,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-23 03:55:26,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:55:26,455 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-11-23 03:55:26,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:55:26,456 INFO L85 PathProgramCache]: Analyzing trace with hash -63732908, now seen corresponding path program 1 times [2022-11-23 03:55:26,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:55:26,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72396899] [2022-11-23 03:55:26,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:55:26,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:55:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:26,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:55:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:26,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:55:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:26,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:55:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:26,695 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-23 03:55:26,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:55:26,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72396899] [2022-11-23 03:55:26,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72396899] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:55:26,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980111218] [2022-11-23 03:55:26,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:55:26,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:55:26,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:55:26,698 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:55:26,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-23 03:55:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:27,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-23 03:55:27,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:55:27,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-23 03:55:27,282 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-23 03:55:27,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:55:27,363 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-23 03:55:27,364 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-11-23 03:55:27,389 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-23 03:55:27,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980111218] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:55:27,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:55:27,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2022-11-23 03:55:27,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402644060] [2022-11-23 03:55:27,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:55:27,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 03:55:27,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:55:27,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 03:55:27,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-23 03:55:27,391 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-11-23 03:55:27,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:55:27,725 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2022-11-23 03:55:27,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 03:55:27,726 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-11-23 03:55:27,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:55:27,727 INFO L225 Difference]: With dead ends: 96 [2022-11-23 03:55:27,727 INFO L226 Difference]: Without dead ends: 96 [2022-11-23 03:55:27,727 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-11-23 03:55:27,727 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 37 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 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-11-23 03:55:27,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 216 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 03:55:27,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-23 03:55:27,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2022-11-23 03:55:27,729 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-11-23 03:55:27,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2022-11-23 03:55:27,730 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 75 [2022-11-23 03:55:27,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:55:27,731 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2022-11-23 03:55:27,731 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-11-23 03:55:27,731 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2022-11-23 03:55:27,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-23 03:55:27,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:55:27,733 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-11-23 03:55:27,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-23 03:55:27,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-23 03:55:27,942 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-11-23 03:55:27,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:55:27,942 INFO L85 PathProgramCache]: Analyzing trace with hash -63732907, now seen corresponding path program 1 times [2022-11-23 03:55:27,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:55:27,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369442114] [2022-11-23 03:55:27,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:55:27,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:55:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:28,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:55:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:28,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:55:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:28,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:55:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:28,353 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-23 03:55:28,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:55:28,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369442114] [2022-11-23 03:55:28,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369442114] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:55:28,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896613145] [2022-11-23 03:55:28,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:55:28,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:55:28,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:55:28,356 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:55:28,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-23 03:55:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:28,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-23 03:55:28,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:55:29,064 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-11-23 03:55:29,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-23 03:55:29,093 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-23 03:55:29,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:55:29,454 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:55:29,454 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-11-23 03:55:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-23 03:55:29,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896613145] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:55:29,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:55:29,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-11-23 03:55:29,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505024522] [2022-11-23 03:55:29,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:55:29,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 03:55:29,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:55:29,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 03:55:29,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-11-23 03:55:29,652 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-11-23 03:55:30,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:55:30,362 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2022-11-23 03:55:30,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 03:55:30,363 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-11-23 03:55:30,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:55:30,364 INFO L225 Difference]: With dead ends: 94 [2022-11-23 03:55:30,364 INFO L226 Difference]: Without dead ends: 94 [2022-11-23 03:55:30,364 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-11-23 03:55:30,365 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 88 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 03:55:30,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 301 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 03:55:30,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-23 03:55:30,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2022-11-23 03:55:30,368 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-11-23 03:55:30,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2022-11-23 03:55:30,369 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 75 [2022-11-23 03:55:30,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:55:30,370 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2022-11-23 03:55:30,370 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-11-23 03:55:30,370 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2022-11-23 03:55:30,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-23 03:55:30,371 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:55:30,371 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-11-23 03:55:30,383 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-11-23 03:55:30,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-23 03:55:30,579 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-11-23 03:55:30,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:55:30,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1975721568, now seen corresponding path program 1 times [2022-11-23 03:55:30,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:55:30,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571682174] [2022-11-23 03:55:30,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:55:30,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:55:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:30,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:55:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:30,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:55:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:30,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:55:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:30,869 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-23 03:55:30,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:55:30,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571682174] [2022-11-23 03:55:30,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571682174] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:55:30,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283269979] [2022-11-23 03:55:30,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:55:30,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:55:30,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:55:30,872 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:55:30,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-23 03:55:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:31,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-23 03:55:31,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:55:31,558 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-11-23 03:55:31,563 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-11-23 03:55:31,585 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-23 03:55:31,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:55:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-23 03:55:31,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283269979] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 03:55:31,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:55:31,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 10 [2022-11-23 03:55:31,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331617777] [2022-11-23 03:55:31,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:55:31,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 03:55:31,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:55:31,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 03:55:31,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-23 03:55:31,865 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-11-23 03:55:32,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:55:32,054 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2022-11-23 03:55:32,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:55:32,055 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-11-23 03:55:32,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:55:32,056 INFO L225 Difference]: With dead ends: 88 [2022-11-23 03:55:32,056 INFO L226 Difference]: Without dead ends: 88 [2022-11-23 03:55:32,057 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-11-23 03:55:32,057 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 63 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:55:32,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 167 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 03:55:32,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-23 03:55:32,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-11-23 03:55:32,061 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-11-23 03:55:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2022-11-23 03:55:32,062 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 76 [2022-11-23 03:55:32,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:55:32,063 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2022-11-23 03:55:32,063 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-11-23 03:55:32,063 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2022-11-23 03:55:32,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-23 03:55:32,064 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:55:32,064 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-11-23 03:55:32,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-23 03:55:32,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-23 03:55:32,271 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-11-23 03:55:32,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:55:32,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1117779724, now seen corresponding path program 1 times [2022-11-23 03:55:32,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:55:32,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131356061] [2022-11-23 03:55:32,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:55:32,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:55:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:33,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:55:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:33,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:55:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:33,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:55:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:33,569 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-23 03:55:33,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:55:33,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131356061] [2022-11-23 03:55:33,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131356061] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:55:33,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004303240] [2022-11-23 03:55:33,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:55:33,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:55:33,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:55:33,571 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:55:33,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-23 03:55:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:34,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-23 03:55:34,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:55:34,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 03:55:34,735 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-11-23 03:55:34,913 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-11-23 03:55:34,938 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-11-23 03:55:34,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:55:34,988 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-11-23 03:55:35,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:55:35,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 03:55:35,205 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:55:35,206 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-11-23 03:55:35,487 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-23 03:55:35,487 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-11-23 03:55:35,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 03:55:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 4 not checked. [2022-11-23 03:55:35,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:55:37,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004303240] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:55:37,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:55:37,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 35 [2022-11-23 03:55:37,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095527083] [2022-11-23 03:55:37,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:55:37,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-23 03:55:37,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:55:37,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-23 03:55:37,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1199, Unknown=24, NotChecked=142, Total=1482 [2022-11-23 03:55:37,193 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-11-23 03:55:40,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:55:40,049 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2022-11-23 03:55:40,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-23 03:55:40,049 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-11-23 03:55:40,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:55:40,050 INFO L225 Difference]: With dead ends: 90 [2022-11-23 03:55:40,050 INFO L226 Difference]: Without dead ends: 90 [2022-11-23 03:55:40,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=389, Invalid=2453, Unknown=28, NotChecked=210, Total=3080 [2022-11-23 03:55:40,052 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 422 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-23 03:55:40,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 335 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 569 Invalid, 0 Unknown, 120 Unchecked, 0.9s Time] [2022-11-23 03:55:40,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-23 03:55:40,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-11-23 03:55:40,055 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-11-23 03:55:40,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2022-11-23 03:55:40,056 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 77 [2022-11-23 03:55:40,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:55:40,057 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2022-11-23 03:55:40,057 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-11-23 03:55:40,057 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2022-11-23 03:55:40,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-23 03:55:40,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:55:40,058 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-11-23 03:55:40,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-23 03:55:40,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:55:40,268 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-11-23 03:55:40,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:55:40,269 INFO L85 PathProgramCache]: Analyzing trace with hash -291432927, now seen corresponding path program 1 times [2022-11-23 03:55:40,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:55:40,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596171792] [2022-11-23 03:55:40,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:55:40,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:55:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:41,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:55:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:41,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:55:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:41,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:55:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:42,534 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-23 03:55:42,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:55:42,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596171792] [2022-11-23 03:55:42,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596171792] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:55:42,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849163527] [2022-11-23 03:55:42,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:55:42,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:55:42,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:55:42,536 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:55:42,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-23 03:55:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:43,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-23 03:55:43,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:55:43,892 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-11-23 03:55:44,077 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-11-23 03:55:44,090 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-11-23 03:55:44,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:55:44,122 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-11-23 03:55:44,586 INFO L321 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-11-23 03:55:44,586 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-11-23 03:55:44,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 03:55:45,224 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 4 not checked. [2022-11-23 03:55:45,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:55:46,063 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-11-23 03:55:46,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849163527] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:55:46,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:55:46,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 38 [2022-11-23 03:55:46,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721214708] [2022-11-23 03:55:46,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:55:46,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-23 03:55:46,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:55:46,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-23 03:55:46,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1353, Unknown=3, NotChecked=228, Total=1722 [2022-11-23 03:55:46,068 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-11-23 03:55:50,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:55:50,823 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2022-11-23 03:55:50,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 03:55:50,824 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-11-23 03:55:50,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:55:50,824 INFO L225 Difference]: With dead ends: 92 [2022-11-23 03:55:50,825 INFO L226 Difference]: Without dead ends: 92 [2022-11-23 03:55:50,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 99 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=414, Invalid=2672, Unknown=6, NotChecked=330, Total=3422 [2022-11-23 03:55:50,826 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 518 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-23 03:55:50,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 418 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 737 Invalid, 0 Unknown, 120 Unchecked, 1.5s Time] [2022-11-23 03:55:50,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-23 03:55:50,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2022-11-23 03:55:50,829 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-11-23 03:55:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2022-11-23 03:55:50,830 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 78 [2022-11-23 03:55:50,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:55:50,831 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2022-11-23 03:55:50,831 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-11-23 03:55:50,831 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2022-11-23 03:55:50,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-23 03:55:50,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:55:50,833 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-11-23 03:55:50,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-23 03:55:51,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-23 03:55:51,042 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-11-23 03:55:51,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:55:51,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1949273415, now seen corresponding path program 1 times [2022-11-23 03:55:51,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:55:51,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320680345] [2022-11-23 03:55:51,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:55:51,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:55:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:57,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:55:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:58,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:55:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:59,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 03:55:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:00,531 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 03:56:00,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:56:00,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320680345] [2022-11-23 03:56:00,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320680345] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:56:00,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537725892] [2022-11-23 03:56:00,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:56:00,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:56:00,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:56:00,533 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:56:00,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7dcf53-a3bd-4eb2-a9ad-b6b33081ffea/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-23 03:56:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:01,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 137 conjunts are in the unsatisfiable core [2022-11-23 03:56:01,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:56:02,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:56:02,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:56:04,026 INFO L321 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-11-23 03:56:04,027 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-11-23 03:56:04,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 03:56:04,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 03:56:04,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 03:56:05,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:56:05,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-23 03:56:05,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:56:05,212 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 03:56:05,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 48 [2022-11-23 03:56:05,241 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-23 03:56:05,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-23 03:56:05,250 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-11-23 03:56:05,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-23 03:56:07,206 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-23 03:56:07,207 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-11-23 03:56:07,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-23 03:56:12,247 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:56:12,247 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-11-23 03:56:16,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 271 treesize of output 231 [2022-11-23 03:56:22,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:57:08,930 WARN L233 SmtUtils]: Spent 46.49s 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-11-23 03:57:08,935 INFO L321 Elim1Store]: treesize reduction 432, result has 90.2 percent of original size [2022-11-23 03:57:08,937 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-11-23 03:57:19,492 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 03:57:29,832 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 03:57:53,558 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 03:57:54,199 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 03:58:21,909 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts.