./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-properties/alternating_list-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/alternating_list-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 941f3dd0e4566f414ae914eed10af26405f8e9f2f3d427c146090b07336d2fc2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 14:39:38,026 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 14:39:38,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 14:39:38,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 14:39:38,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 14:39:38,046 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 14:39:38,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 14:39:38,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 14:39:38,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 14:39:38,050 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 14:39:38,051 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 14:39:38,052 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 14:39:38,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 14:39:38,053 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 14:39:38,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 14:39:38,055 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 14:39:38,056 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 14:39:38,057 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 14:39:38,058 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 14:39:38,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 14:39:38,061 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 14:39:38,062 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 14:39:38,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 14:39:38,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 14:39:38,067 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 14:39:38,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 14:39:38,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 14:39:38,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 14:39:38,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 14:39:38,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 14:39:38,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 14:39:38,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 14:39:38,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 14:39:38,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 14:39:38,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 14:39:38,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 14:39:38,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 14:39:38,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 14:39:38,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 14:39:38,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 14:39:38,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 14:39:38,076 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 14:39:38,096 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 14:39:38,096 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 14:39:38,097 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 14:39:38,097 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 14:39:38,097 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 14:39:38,097 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 14:39:38,098 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 14:39:38,098 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 14:39:38,098 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 14:39:38,098 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 14:39:38,098 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 14:39:38,098 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 14:39:38,099 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 14:39:38,099 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 14:39:38,099 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 14:39:38,099 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 14:39:38,099 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 14:39:38,099 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 14:39:38,100 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 14:39:38,100 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 14:39:38,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 14:39:38,101 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 14:39:38,101 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 14:39:38,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 14:39:38,101 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 14:39:38,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 14:39:38,101 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 14:39:38,101 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 14:39:38,102 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 14:39:38,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 14:39:38,102 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 14:39:38,102 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 14:39:38,102 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 14:39:38,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 14:39:38,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 14:39:38,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:39:38,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 14:39:38,103 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 14:39:38,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 14:39:38,103 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 14:39:38,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 14:39:38,104 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 14:39:38,104 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/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_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh 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 -> Taipan 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 -> 941f3dd0e4566f414ae914eed10af26405f8e9f2f3d427c146090b07336d2fc2 [2022-12-14 14:39:38,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 14:39:38,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 14:39:38,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 14:39:38,311 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 14:39:38,311 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 14:39:38,312 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/list-properties/alternating_list-1.i [2022-12-14 14:39:40,957 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 14:39:41,139 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 14:39:41,139 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/sv-benchmarks/c/list-properties/alternating_list-1.i [2022-12-14 14:39:41,148 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/data/1b7e9b703/6fcbc65634504a759aab9d4f66a1c060/FLAG2583c45c1 [2022-12-14 14:39:41,163 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/data/1b7e9b703/6fcbc65634504a759aab9d4f66a1c060 [2022-12-14 14:39:41,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 14:39:41,167 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 14:39:41,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 14:39:41,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 14:39:41,173 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 14:39:41,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:39:41" (1/1) ... [2022-12-14 14:39:41,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@512291b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:39:41, skipping insertion in model container [2022-12-14 14:39:41,175 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:39:41" (1/1) ... [2022-12-14 14:39:41,180 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 14:39:41,214 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 14:39:41,451 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_c4a21e6e-d866-49bf-9134-83cbea9f68bd/sv-benchmarks/c/list-properties/alternating_list-1.i[23574,23587] [2022-12-14 14:39:41,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:39:41,462 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 14:39:41,495 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_c4a21e6e-d866-49bf-9134-83cbea9f68bd/sv-benchmarks/c/list-properties/alternating_list-1.i[23574,23587] [2022-12-14 14:39:41,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:39:41,519 INFO L208 MainTranslator]: Completed translation [2022-12-14 14:39:41,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:39:41 WrapperNode [2022-12-14 14:39:41,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 14:39:41,521 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 14:39:41,521 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 14:39:41,521 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 14:39:41,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:39:41" (1/1) ... [2022-12-14 14:39:41,541 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:39:41" (1/1) ... [2022-12-14 14:39:41,560 INFO L138 Inliner]: procedures = 124, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 91 [2022-12-14 14:39:41,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 14:39:41,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 14:39:41,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 14:39:41,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 14:39:41,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:39:41" (1/1) ... [2022-12-14 14:39:41,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:39:41" (1/1) ... [2022-12-14 14:39:41,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:39:41" (1/1) ... [2022-12-14 14:39:41,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:39:41" (1/1) ... [2022-12-14 14:39:41,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:39:41" (1/1) ... [2022-12-14 14:39:41,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:39:41" (1/1) ... [2022-12-14 14:39:41,587 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:39:41" (1/1) ... [2022-12-14 14:39:41,588 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:39:41" (1/1) ... [2022-12-14 14:39:41,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 14:39:41,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 14:39:41,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 14:39:41,592 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 14:39:41,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:39:41" (1/1) ... [2022-12-14 14:39:41,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:39:41,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:39:41,620 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 14:39:41,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 14:39:41,662 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-12-14 14:39:41,662 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-12-14 14:39:41,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 14:39:41,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 14:39:41,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 14:39:41,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 14:39:41,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 14:39:41,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 14:39:41,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 14:39:41,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 14:39:41,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 14:39:41,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 14:39:41,749 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 14:39:41,751 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 14:39:41,773 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-12-14 14:39:41,957 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 14:39:41,993 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 14:39:41,993 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-14 14:39:41,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:39:41 BoogieIcfgContainer [2022-12-14 14:39:41,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 14:39:41,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 14:39:41,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 14:39:42,001 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 14:39:42,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 02:39:41" (1/3) ... [2022-12-14 14:39:42,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f1cb0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:39:42, skipping insertion in model container [2022-12-14 14:39:42,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:39:41" (2/3) ... [2022-12-14 14:39:42,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f1cb0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:39:42, skipping insertion in model container [2022-12-14 14:39:42,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:39:41" (3/3) ... [2022-12-14 14:39:42,004 INFO L112 eAbstractionObserver]: Analyzing ICFG alternating_list-1.i [2022-12-14 14:39:42,020 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 14:39:42,020 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-12-14 14:39:42,054 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 14:39:42,059 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7bdeeafc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 14:39:42,059 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-12-14 14:39:42,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 35 states have (on average 2.2) internal successors, (77), 66 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:42,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 14:39:42,067 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:42,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 14:39:42,069 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-12-14 14:39:42,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:42,074 INFO L85 PathProgramCache]: Analyzing trace with hash 167560794, now seen corresponding path program 1 times [2022-12-14 14:39:42,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:42,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740394319] [2022-12-14 14:39:42,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:42,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:42,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:42,235 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:42,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740394319] [2022-12-14 14:39:42,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740394319] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:39:42,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:39:42,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:39:42,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466709915] [2022-12-14 14:39:42,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:39:42,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 14:39:42,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:42,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 14:39:42,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 14:39:42,263 INFO L87 Difference]: Start difference. First operand has 68 states, 35 states have (on average 2.2) internal successors, (77), 66 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:42,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:42,296 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2022-12-14 14:39:42,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 14:39:42,297 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 14:39:42,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:42,302 INFO L225 Difference]: With dead ends: 68 [2022-12-14 14:39:42,302 INFO L226 Difference]: Without dead ends: 63 [2022-12-14 14:39:42,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 14:39:42,306 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:42,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:39:42,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-12-14 14:39:42,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-12-14 14:39:42,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 62 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:42,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2022-12-14 14:39:42,330 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 5 [2022-12-14 14:39:42,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:42,330 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2022-12-14 14:39:42,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:42,331 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2022-12-14 14:39:42,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 14:39:42,331 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:42,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 14:39:42,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 14:39:42,331 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-12-14 14:39:42,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:42,332 INFO L85 PathProgramCache]: Analyzing trace with hash 899381665, now seen corresponding path program 1 times [2022-12-14 14:39:42,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:42,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866857785] [2022-12-14 14:39:42,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:42,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:42,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:42,423 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:42,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866857785] [2022-12-14 14:39:42,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866857785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:39:42,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:39:42,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:39:42,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037451841] [2022-12-14 14:39:42,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:39:42,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:39:42,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:42,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:39:42,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:39:42,427 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:42,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:42,532 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-12-14 14:39:42,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:39:42,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 14:39:42,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:42,534 INFO L225 Difference]: With dead ends: 83 [2022-12-14 14:39:42,534 INFO L226 Difference]: Without dead ends: 83 [2022-12-14 14:39:42,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:39:42,535 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 111 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:42,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 41 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:39:42,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-12-14 14:39:42,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2022-12-14 14:39:42,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.853658536585366) internal successors, (76), 63 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:42,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2022-12-14 14:39:42,540 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 6 [2022-12-14 14:39:42,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:42,541 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2022-12-14 14:39:42,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:42,541 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2022-12-14 14:39:42,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 14:39:42,541 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:42,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 14:39:42,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 14:39:42,542 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-12-14 14:39:42,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:42,542 INFO L85 PathProgramCache]: Analyzing trace with hash 899381666, now seen corresponding path program 1 times [2022-12-14 14:39:42,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:42,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601950760] [2022-12-14 14:39:42,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:42,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:42,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:42,633 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:42,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601950760] [2022-12-14 14:39:42,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601950760] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:39:42,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:39:42,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:39:42,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512399350] [2022-12-14 14:39:42,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:39:42,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:39:42,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:42,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:39:42,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:39:42,635 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:42,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:42,734 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2022-12-14 14:39:42,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 14:39:42,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 14:39:42,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:42,736 INFO L225 Difference]: With dead ends: 86 [2022-12-14 14:39:42,736 INFO L226 Difference]: Without dead ends: 86 [2022-12-14 14:39:42,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:39:42,737 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 119 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:42,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 52 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:39:42,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-12-14 14:39:42,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2022-12-14 14:39:42,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 77 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:42,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2022-12-14 14:39:42,743 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 6 [2022-12-14 14:39:42,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:42,744 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2022-12-14 14:39:42,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:42,744 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2022-12-14 14:39:42,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 14:39:42,744 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:42,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:39:42,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 14:39:42,745 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-12-14 14:39:42,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:42,746 INFO L85 PathProgramCache]: Analyzing trace with hash 412646002, now seen corresponding path program 1 times [2022-12-14 14:39:42,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:42,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65968706] [2022-12-14 14:39:42,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:42,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:42,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:42,798 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:42,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65968706] [2022-12-14 14:39:42,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65968706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:39:42,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:39:42,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:39:42,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127593026] [2022-12-14 14:39:42,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:39:42,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:39:42,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:42,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:39:42,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:39:42,801 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:42,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:42,824 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2022-12-14 14:39:42,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:39:42,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-14 14:39:42,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:42,826 INFO L225 Difference]: With dead ends: 123 [2022-12-14 14:39:42,826 INFO L226 Difference]: Without dead ends: 123 [2022-12-14 14:39:42,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:39:42,827 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 46 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:42,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 106 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:39:42,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-12-14 14:39:42,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 86. [2022-12-14 14:39:42,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.619047619047619) internal successors, (102), 85 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:42,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2022-12-14 14:39:42,835 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 12 [2022-12-14 14:39:42,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:42,835 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2022-12-14 14:39:42,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:42,835 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2022-12-14 14:39:42,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 14:39:42,836 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:42,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:39:42,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 14:39:42,836 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-12-14 14:39:42,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:42,837 INFO L85 PathProgramCache]: Analyzing trace with hash 412338172, now seen corresponding path program 1 times [2022-12-14 14:39:42,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:42,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399052048] [2022-12-14 14:39:42,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:42,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:42,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:42,963 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:42,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399052048] [2022-12-14 14:39:42,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399052048] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:39:42,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:39:42,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 14:39:42,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159833936] [2022-12-14 14:39:42,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:39:42,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:39:42,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:42,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:39:42,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:39:42,965 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:43,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:43,071 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2022-12-14 14:39:43,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:39:43,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-14 14:39:43,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:43,073 INFO L225 Difference]: With dead ends: 106 [2022-12-14 14:39:43,073 INFO L226 Difference]: Without dead ends: 106 [2022-12-14 14:39:43,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 14:39:43,074 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 42 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:43,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 136 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:39:43,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-12-14 14:39:43,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2022-12-14 14:39:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.6) internal successors, (104), 87 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:43,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2022-12-14 14:39:43,081 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 12 [2022-12-14 14:39:43,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:43,082 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2022-12-14 14:39:43,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:43,082 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2022-12-14 14:39:43,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 14:39:43,083 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:43,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:39:43,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 14:39:43,083 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-12-14 14:39:43,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:43,084 INFO L85 PathProgramCache]: Analyzing trace with hash -133788534, now seen corresponding path program 1 times [2022-12-14 14:39:43,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:43,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387304382] [2022-12-14 14:39:43,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:43,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:43,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:43,144 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:43,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387304382] [2022-12-14 14:39:43,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387304382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:39:43,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:39:43,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:39:43,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454569814] [2022-12-14 14:39:43,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:39:43,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:39:43,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:43,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:39:43,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:39:43,146 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:43,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:43,205 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2022-12-14 14:39:43,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 14:39:43,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 14:39:43,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:43,207 INFO L225 Difference]: With dead ends: 92 [2022-12-14 14:39:43,207 INFO L226 Difference]: Without dead ends: 92 [2022-12-14 14:39:43,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:39:43,208 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 94 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:43,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 62 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:39:43,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-12-14 14:39:43,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2022-12-14 14:39:43,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.5909090909090908) internal successors, (105), 88 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:43,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2022-12-14 14:39:43,214 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 13 [2022-12-14 14:39:43,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:43,215 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2022-12-14 14:39:43,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:43,215 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2022-12-14 14:39:43,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 14:39:43,215 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:43,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:39:43,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 14:39:43,216 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-12-14 14:39:43,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:43,217 INFO L85 PathProgramCache]: Analyzing trace with hash -133785972, now seen corresponding path program 1 times [2022-12-14 14:39:43,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:43,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628846122] [2022-12-14 14:39:43,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:43,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:43,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:43,269 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:43,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628846122] [2022-12-14 14:39:43,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628846122] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:39:43,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:39:43,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:39:43,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464946951] [2022-12-14 14:39:43,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:39:43,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:39:43,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:43,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:39:43,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:39:43,271 INFO L87 Difference]: Start difference. First operand 89 states and 105 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:43,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:43,337 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2022-12-14 14:39:43,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:39:43,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 14:39:43,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:43,338 INFO L225 Difference]: With dead ends: 96 [2022-12-14 14:39:43,338 INFO L226 Difference]: Without dead ends: 96 [2022-12-14 14:39:43,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 14:39:43,339 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 112 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 113 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.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:43,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 113 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:39:43,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-12-14 14:39:43,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2022-12-14 14:39:43,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 89 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:43,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2022-12-14 14:39:43,343 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 13 [2022-12-14 14:39:43,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:43,343 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2022-12-14 14:39:43,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:43,343 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2022-12-14 14:39:43,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 14:39:43,344 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:43,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:39:43,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 14:39:43,344 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-12-14 14:39:43,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:43,344 INFO L85 PathProgramCache]: Analyzing trace with hash 147602317, now seen corresponding path program 1 times [2022-12-14 14:39:43,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:43,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037729781] [2022-12-14 14:39:43,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:43,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:43,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:43,411 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:43,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037729781] [2022-12-14 14:39:43,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037729781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:39:43,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:39:43,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 14:39:43,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280359200] [2022-12-14 14:39:43,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:39:43,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 14:39:43,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:43,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 14:39:43,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-14 14:39:43,413 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:43,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:43,547 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2022-12-14 14:39:43,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 14:39:43,548 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-14 14:39:43,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:43,549 INFO L225 Difference]: With dead ends: 103 [2022-12-14 14:39:43,549 INFO L226 Difference]: Without dead ends: 103 [2022-12-14 14:39:43,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-14 14:39:43,550 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 47 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:43,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 212 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:39:43,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-12-14 14:39:43,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2022-12-14 14:39:43,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 92 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:43,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2022-12-14 14:39:43,555 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 14 [2022-12-14 14:39:43,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:43,555 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2022-12-14 14:39:43,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:43,555 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-12-14 14:39:43,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 14:39:43,556 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:43,556 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:39:43,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 14:39:43,556 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-12-14 14:39:43,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:43,556 INFO L85 PathProgramCache]: Analyzing trace with hash -902756227, now seen corresponding path program 1 times [2022-12-14 14:39:43,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:43,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659544422] [2022-12-14 14:39:43,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:43,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:43,641 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:43,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659544422] [2022-12-14 14:39:43,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659544422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:39:43,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:39:43,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:39:43,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089906594] [2022-12-14 14:39:43,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:39:43,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:39:43,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:43,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:39:43,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:39:43,642 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:43,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:43,726 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2022-12-14 14:39:43,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:39:43,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-14 14:39:43,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:43,727 INFO L225 Difference]: With dead ends: 100 [2022-12-14 14:39:43,727 INFO L226 Difference]: Without dead ends: 100 [2022-12-14 14:39:43,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 14:39:43,728 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 78 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:43,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 88 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:39:43,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-12-14 14:39:43,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2022-12-14 14:39:43,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.5142857142857142) internal successors, (106), 89 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:43,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2022-12-14 14:39:43,733 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 14 [2022-12-14 14:39:43,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:43,733 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2022-12-14 14:39:43,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:43,733 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2022-12-14 14:39:43,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 14:39:43,734 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:43,734 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:39:43,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 14:39:43,734 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-12-14 14:39:43,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:43,734 INFO L85 PathProgramCache]: Analyzing trace with hash -902756226, now seen corresponding path program 1 times [2022-12-14 14:39:43,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:43,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085959108] [2022-12-14 14:39:43,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:43,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:43,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:43,846 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:43,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085959108] [2022-12-14 14:39:43,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085959108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:39:43,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:39:43,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:39:43,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993636701] [2022-12-14 14:39:43,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:39:43,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:39:43,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:43,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:39:43,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:39:43,848 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:43,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:43,952 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2022-12-14 14:39:43,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:39:43,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-14 14:39:43,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:43,952 INFO L225 Difference]: With dead ends: 93 [2022-12-14 14:39:43,952 INFO L226 Difference]: Without dead ends: 93 [2022-12-14 14:39:43,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 14:39:43,953 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 55 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:43,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 114 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:39:43,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-12-14 14:39:43,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2022-12-14 14:39:43,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.453125) internal successors, (93), 78 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:43,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2022-12-14 14:39:43,956 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 14 [2022-12-14 14:39:43,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:43,956 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2022-12-14 14:39:43,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:43,956 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2022-12-14 14:39:43,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 14:39:43,957 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:43,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:39:43,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 14:39:43,957 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-12-14 14:39:43,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:43,958 INFO L85 PathProgramCache]: Analyzing trace with hash 278242960, now seen corresponding path program 1 times [2022-12-14 14:39:43,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:43,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537725345] [2022-12-14 14:39:43,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:43,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:44,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:44,009 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:44,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537725345] [2022-12-14 14:39:44,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537725345] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:39:44,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:39:44,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:39:44,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799395593] [2022-12-14 14:39:44,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:39:44,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:39:44,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:44,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:39:44,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:39:44,011 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:44,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:44,077 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2022-12-14 14:39:44,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:39:44,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 14:39:44,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:44,079 INFO L225 Difference]: With dead ends: 89 [2022-12-14 14:39:44,079 INFO L226 Difference]: Without dead ends: 79 [2022-12-14 14:39:44,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 14:39:44,079 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:44,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 121 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:39:44,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-12-14 14:39:44,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2022-12-14 14:39:44,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.459016393442623) internal successors, (89), 75 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:44,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2022-12-14 14:39:44,082 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 15 [2022-12-14 14:39:44,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:44,082 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2022-12-14 14:39:44,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:44,082 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2022-12-14 14:39:44,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 14:39:44,083 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:44,083 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:39:44,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 14:39:44,083 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-12-14 14:39:44,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:44,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1411498456, now seen corresponding path program 1 times [2022-12-14 14:39:44,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:44,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716806775] [2022-12-14 14:39:44,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:44,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:44,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:44,310 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:44,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716806775] [2022-12-14 14:39:44,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716806775] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:39:44,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627264062] [2022-12-14 14:39:44,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:44,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:44,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:39:44,311 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:39:44,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 14:39:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:44,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-14 14:39:44,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:39:44,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:39:44,521 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:39:44,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:39:44,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:44,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 14:39:44,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:39:44,622 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 20 treesize of output 8 [2022-12-14 14:39:44,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:39:44,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 14:39:44,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:44,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:39:44,860 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:39:44,860 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-12-14 14:39:44,874 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 14:39:44,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2022-12-14 14:39:44,879 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 9 treesize of output 7 [2022-12-14 14:39:44,888 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 14:39:44,889 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 12 [2022-12-14 14:39:44,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:44,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627264062] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:39:44,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1951128582] [2022-12-14 14:39:44,951 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-12-14 14:39:44,951 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:39:44,954 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:39:44,958 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:39:44,959 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:39:44,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:44,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:44,993 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 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 14:39:45,045 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 15 treesize of output 1 [2022-12-14 14:39:45,052 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 15 treesize of output 1 [2022-12-14 14:39:45,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:45,060 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-14 14:39:45,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:45,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:45,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:45,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:45,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:45,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 14:39:45,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:39:45,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:45,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:45,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 14:39:45,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:39:45,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:45,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:45,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:45,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:45,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:45,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 14:39:45,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:39:45,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:45,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:45,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 14:39:45,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:39:45,362 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:39:45,362 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 260 treesize of output 242 [2022-12-14 14:39:45,383 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:39:45,417 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-12-14 14:39:45,418 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-12-14 14:39:45,450 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:39:45,450 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 256 treesize of output 238 [2022-12-14 14:39:45,906 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:39:48,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1951128582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:39:48,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:39:48,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [10, 9, 9] total 34 [2022-12-14 14:39:48,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434196285] [2022-12-14 14:39:48,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:39:48,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 14:39:48,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:48,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 14:39:48,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=886, Unknown=4, NotChecked=0, Total=1122 [2022-12-14 14:39:48,691 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:49,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:49,352 INFO L93 Difference]: Finished difference Result 103 states and 121 transitions. [2022-12-14 14:39:49,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 14:39:49,353 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 14:39:49,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:49,353 INFO L225 Difference]: With dead ends: 103 [2022-12-14 14:39:49,353 INFO L226 Difference]: Without dead ends: 103 [2022-12-14 14:39:49,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=252, Invalid=1004, Unknown=4, NotChecked=0, Total=1260 [2022-12-14 14:39:49,354 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 25 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:49,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 93 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 14:39:49,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-12-14 14:39:49,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2022-12-14 14:39:49,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 92 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:49,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2022-12-14 14:39:49,356 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 20 [2022-12-14 14:39:49,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:49,356 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2022-12-14 14:39:49,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:49,356 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-12-14 14:39:49,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 14:39:49,357 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:49,357 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:39:49,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 14:39:49,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:49,559 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-12-14 14:39:49,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:49,560 INFO L85 PathProgramCache]: Analyzing trace with hash 2138902324, now seen corresponding path program 1 times [2022-12-14 14:39:49,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:49,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768407126] [2022-12-14 14:39:49,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:49,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:49,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:49,742 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:49,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768407126] [2022-12-14 14:39:49,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768407126] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:39:49,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533639819] [2022-12-14 14:39:49,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:49,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:49,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:39:49,743 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:39:49,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 14:39:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:49,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-14 14:39:49,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:39:49,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:39:49,870 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:39:49,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:39:49,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:49,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 14:39:49,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:39:49,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-12-14 14:39:49,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:39:49,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 14:39:50,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:50,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:39:50,052 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_191 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2022-12-14 14:39:50,178 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:39:50,179 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-12-14 14:39:50,187 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 14:39:50,187 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 30 treesize of output 29 [2022-12-14 14:39:50,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-14 14:39:50,197 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 14:39:50,197 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 12 [2022-12-14 14:39:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 14:39:50,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533639819] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:39:50,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1027887375] [2022-12-14 14:39:50,231 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-12-14 14:39:50,231 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:39:50,232 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:39:50,232 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:39:50,232 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:39:50,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:50,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:50,249 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 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 14:39:50,276 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 15 treesize of output 1 [2022-12-14 14:39:50,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:50,282 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-14 14:39:50,289 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 15 treesize of output 1 [2022-12-14 14:39:50,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:50,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:50,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:50,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:50,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:50,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 14:39:50,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:39:50,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:39:50,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:50,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:50,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 14:39:50,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:50,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:50,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:50,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:50,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:50,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 14:39:50,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:39:50,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:50,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:50,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 14:39:50,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:39:50,510 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:39:50,511 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 260 treesize of output 242 [2022-12-14 14:39:50,530 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:39:50,531 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 260 treesize of output 242 [2022-12-14 14:39:50,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:39:50,569 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-12-14 14:39:50,569 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-12-14 14:39:50,830 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:39:53,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1027887375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:39:53,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:39:53,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11, 9, 10] total 39 [2022-12-14 14:39:53,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437490541] [2022-12-14 14:39:53,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:39:53,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 14:39:53,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:53,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 14:39:53,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1181, Unknown=16, NotChecked=72, Total=1482 [2022-12-14 14:39:53,985 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:54,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:54,433 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2022-12-14 14:39:54,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 14:39:54,433 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 14:39:54,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:54,434 INFO L225 Difference]: With dead ends: 101 [2022-12-14 14:39:54,434 INFO L226 Difference]: Without dead ends: 94 [2022-12-14 14:39:54,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=223, Invalid=1247, Unknown=16, NotChecked=74, Total=1560 [2022-12-14 14:39:54,435 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:54,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 95 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:39:54,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-12-14 14:39:54,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2022-12-14 14:39:54,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 92 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:54,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2022-12-14 14:39:54,437 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 23 [2022-12-14 14:39:54,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:54,437 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2022-12-14 14:39:54,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:54,437 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2022-12-14 14:39:54,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:39:54,438 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:54,438 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:39:54,442 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 14:39:54,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 14:39:54,640 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-12-14 14:39:54,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:54,641 INFO L85 PathProgramCache]: Analyzing trace with hash 192746989, now seen corresponding path program 1 times [2022-12-14 14:39:54,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:54,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645048075] [2022-12-14 14:39:54,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:54,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 14:39:54,710 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:54,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645048075] [2022-12-14 14:39:54,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645048075] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:39:54,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:39:54,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:39:54,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201764844] [2022-12-14 14:39:54,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:39:54,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:39:54,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:54,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:39:54,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:39:54,711 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:54,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:54,737 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2022-12-14 14:39:54,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:39:54,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 14:39:54,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:54,738 INFO L225 Difference]: With dead ends: 91 [2022-12-14 14:39:54,738 INFO L226 Difference]: Without dead ends: 91 [2022-12-14 14:39:54,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:39:54,739 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 19 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:54,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 46 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:39:54,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-12-14 14:39:54,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-12-14 14:39:54,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.358974358974359) internal successors, (106), 90 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:54,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2022-12-14 14:39:54,742 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 106 transitions. Word has length 24 [2022-12-14 14:39:54,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:54,742 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 106 transitions. [2022-12-14 14:39:54,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:54,742 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2022-12-14 14:39:54,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 14:39:54,743 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:54,743 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:39:54,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 14:39:54,743 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-12-14 14:39:54,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:54,744 INFO L85 PathProgramCache]: Analyzing trace with hash 546263767, now seen corresponding path program 1 times [2022-12-14 14:39:54,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:54,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643707993] [2022-12-14 14:39:54,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:54,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:55,088 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:55,089 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:55,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643707993] [2022-12-14 14:39:55,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643707993] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:39:55,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684836330] [2022-12-14 14:39:55,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:55,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:55,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:39:55,090 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:39:55,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 14:39:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:55,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 14:39:55,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:39:55,207 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:39:55,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:39:55,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:39:55,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:39:55,270 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:39:55,270 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 52 treesize of output 49 [2022-12-14 14:39:55,273 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 34 treesize of output 36 [2022-12-14 14:39:55,276 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 23 treesize of output 15 [2022-12-14 14:39:55,316 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 31 treesize of output 19 [2022-12-14 14:39:55,319 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 19 treesize of output 11 [2022-12-14 14:39:55,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 15 treesize of output 7 [2022-12-14 14:39:55,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:55,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:39:55,352 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 79 treesize of output 57 [2022-12-14 14:39:55,406 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_264 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_264) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse0)) (forall ((v_ArrVal_263 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_263) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2)))))) is different from false [2022-12-14 14:39:55,412 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:39:55,412 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 22 treesize of output 23 [2022-12-14 14:39:55,418 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:39:55,418 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 36 treesize of output 35 [2022-12-14 14:39:55,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 14:39:55,431 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-14 14:39:55,432 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 22 treesize of output 1 [2022-12-14 14:39:55,500 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:39:55,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-12-14 14:39:55,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:55,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684836330] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:39:55,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [14989783] [2022-12-14 14:39:55,573 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-12-14 14:39:55,573 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:39:55,574 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:39:55,574 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:39:55,574 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:39:55,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:55,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:55,591 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 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 14:39:55,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:55,625 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-14 14:39:55,633 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 15 treesize of output 1 [2022-12-14 14:39:55,638 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 15 treesize of output 1 [2022-12-14 14:39:55,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:55,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:55,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:55,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:55,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:55,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 14:39:55,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:55,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:55,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 14:39:55,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:39:55,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:39:55,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:55,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:55,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:55,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:55,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:55,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 14:39:55,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:39:55,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:39:55,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:55,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:55,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 14:39:55,861 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:39:55,862 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 260 treesize of output 242 [2022-12-14 14:39:55,879 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:39:55,904 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-12-14 14:39:55,904 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-12-14 14:39:55,925 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:39:55,925 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 256 treesize of output 238 [2022-12-14 14:39:56,370 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:39:58,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [14989783] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:39:58,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:39:58,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [11, 10, 10] total 32 [2022-12-14 14:39:58,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320991699] [2022-12-14 14:39:58,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:39:58,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 14:39:58,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:58,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 14:39:58,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=779, Unknown=4, NotChecked=60, Total=1056 [2022-12-14 14:39:58,554 INFO L87 Difference]: Start difference. First operand 91 states and 106 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:58,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:58,933 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-12-14 14:39:58,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 14:39:58,933 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 14:39:58,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:58,933 INFO L225 Difference]: With dead ends: 77 [2022-12-14 14:39:58,933 INFO L226 Difference]: Without dead ends: 77 [2022-12-14 14:39:58,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=228, Invalid=828, Unknown=4, NotChecked=62, Total=1122 [2022-12-14 14:39:58,934 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 37 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:58,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 53 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:39:58,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-12-14 14:39:58,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2022-12-14 14:39:58,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 70 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:58,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2022-12-14 14:39:58,935 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 26 [2022-12-14 14:39:58,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:58,936 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2022-12-14 14:39:58,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:58,936 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2022-12-14 14:39:58,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 14:39:58,936 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:58,936 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:39:58,941 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 14:39:59,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 14:39:59,138 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-12-14 14:39:59,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:59,138 INFO L85 PathProgramCache]: Analyzing trace with hash -294744398, now seen corresponding path program 1 times [2022-12-14 14:39:59,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:59,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723184305] [2022-12-14 14:39:59,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:59,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:59,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 14:39:59,199 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:59,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723184305] [2022-12-14 14:39:59,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723184305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:39:59,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:39:59,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:39:59,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036466606] [2022-12-14 14:39:59,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:39:59,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:39:59,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:59,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:39:59,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:39:59,201 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:59,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:59,259 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2022-12-14 14:39:59,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:39:59,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 14:39:59,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:59,260 INFO L225 Difference]: With dead ends: 80 [2022-12-14 14:39:59,260 INFO L226 Difference]: Without dead ends: 80 [2022-12-14 14:39:59,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 14:39:59,261 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 62 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:59,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 54 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:39:59,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-14 14:39:59,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2022-12-14 14:39:59,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.253968253968254) internal successors, (79), 71 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:59,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2022-12-14 14:39:59,263 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 28 [2022-12-14 14:39:59,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:59,263 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2022-12-14 14:39:59,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:59,264 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-12-14 14:39:59,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 14:39:59,264 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:59,264 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:39:59,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 14:39:59,264 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-12-14 14:39:59,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:59,265 INFO L85 PathProgramCache]: Analyzing trace with hash -549603317, now seen corresponding path program 1 times [2022-12-14 14:39:59,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:59,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337909486] [2022-12-14 14:39:59,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:59,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:59,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:39:59,353 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:59,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337909486] [2022-12-14 14:39:59,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337909486] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:39:59,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368277564] [2022-12-14 14:39:59,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:59,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:59,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:39:59,355 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:39:59,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 14:39:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:59,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-14 14:39:59,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:39:59,470 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:39:59,470 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 15 [2022-12-14 14:39:59,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:39:59,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:39:59,579 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 14:39:59,580 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 17 treesize of output 16 [2022-12-14 14:39:59,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:39:59,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368277564] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:39:59,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [792799195] [2022-12-14 14:39:59,599 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-12-14 14:39:59,599 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:39:59,599 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:39:59,599 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:39:59,599 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:39:59,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:59,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:59,618 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 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 14:39:59,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:59,653 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-14 14:39:59,660 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 15 treesize of output 1 [2022-12-14 14:39:59,665 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 15 treesize of output 1 [2022-12-14 14:39:59,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:59,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:59,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:59,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:59,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:59,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 14:39:59,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:59,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:59,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 14:39:59,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:39:59,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:39:59,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:39:59,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:39:59,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:59,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:59,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 14:39:59,866 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:39:59,867 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 260 treesize of output 242 [2022-12-14 14:39:59,879 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:39:59,912 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-12-14 14:39:59,912 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-12-14 14:39:59,937 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:39:59,938 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 256 treesize of output 238 [2022-12-14 14:40:00,214 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 14:40:00,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:00,287 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-14 14:40:00,294 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 15 treesize of output 1 [2022-12-14 14:40:00,300 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 15 treesize of output 1 [2022-12-14 14:40:00,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:00,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:00,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:00,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:00,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:00,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 14:40:00,320 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:40:02,760 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3679#(and (or (and (= |ULTIMATE.start_main_~flag~0#1| 1) (= |#NULL.base| 0)) (and (= |ULTIMATE.start_main_~t~0#1.offset| 0) (= |#NULL.base| 0))) (< |ULTIMATE.start_main_~p~0#1.base| |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~flag~0#1| 1) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (<= 0 |ULTIMATE.start_main_~flag~0#1|) (<= |#NULL.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 0) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2022-12-14 14:40:02,760 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:40:02,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:40:02,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-12-14 14:40:02,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226167277] [2022-12-14 14:40:02,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:40:02,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 14:40:02,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:40:02,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 14:40:02,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2022-12-14 14:40:02,762 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:03,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:40:03,037 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2022-12-14 14:40:03,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 14:40:03,037 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 14:40:03,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:40:03,038 INFO L225 Difference]: With dead ends: 92 [2022-12-14 14:40:03,038 INFO L226 Difference]: Without dead ends: 92 [2022-12-14 14:40:03,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=394, Invalid=1768, Unknown=0, NotChecked=0, Total=2162 [2022-12-14 14:40:03,038 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 192 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:40:03,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 243 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:40:03,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-12-14 14:40:03,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2022-12-14 14:40:03,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 71 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:03,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2022-12-14 14:40:03,040 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 29 [2022-12-14 14:40:03,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:40:03,040 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2022-12-14 14:40:03,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:03,040 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-12-14 14:40:03,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 14:40:03,041 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:40:03,041 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:40:03,045 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 14:40:03,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:40:03,242 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-12-14 14:40:03,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:40:03,243 INFO L85 PathProgramCache]: Analyzing trace with hash -547141591, now seen corresponding path program 1 times [2022-12-14 14:40:03,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:40:03,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716953066] [2022-12-14 14:40:03,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:40:03,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:40:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:40:03,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:40:03,306 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:40:03,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716953066] [2022-12-14 14:40:03,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716953066] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:40:03,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352576562] [2022-12-14 14:40:03,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:40:03,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:40:03,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:40:03,307 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:40:03,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 14:40:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:40:03,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 14:40:03,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:40:03,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:40:03,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:40:03,418 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 14:40:03,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-12-14 14:40:03,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:40:03,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352576562] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:40:03,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1852987318] [2022-12-14 14:40:03,427 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-12-14 14:40:03,428 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:40:03,428 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:40:03,428 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:40:03,428 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:40:03,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:03,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:03,446 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 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 14:40:03,475 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 15 treesize of output 1 [2022-12-14 14:40:03,480 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 15 treesize of output 1 [2022-12-14 14:40:03,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:03,486 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-14 14:40:03,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:03,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:03,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:03,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:03,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:03,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 14:40:03,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:03,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:03,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 14:40:03,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:03,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:03,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:03,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:03,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:03,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 14:40:03,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:03,695 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:40:03,696 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 260 treesize of output 242 [2022-12-14 14:40:03,707 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:40:03,731 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-12-14 14:40:03,731 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-12-14 14:40:03,751 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:40:03,752 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 256 treesize of output 238 [2022-12-14 14:40:04,258 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 15 treesize of output 1 [2022-12-14 14:40:04,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:04,264 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-14 14:40:04,270 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 15 treesize of output 1 [2022-12-14 14:40:04,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:04,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:04,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:04,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:04,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:04,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 14:40:04,289 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:40:06,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1852987318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:40:06,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:40:06,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [6, 5, 5] total 23 [2022-12-14 14:40:06,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561124722] [2022-12-14 14:40:06,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:40:06,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 14:40:06,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:40:06,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 14:40:06,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2022-12-14 14:40:06,726 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:07,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:40:07,297 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2022-12-14 14:40:07,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 14:40:07,297 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 14:40:07,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:40:07,298 INFO L225 Difference]: With dead ends: 77 [2022-12-14 14:40:07,298 INFO L226 Difference]: Without dead ends: 77 [2022-12-14 14:40:07,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2022-12-14 14:40:07,298 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 58 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:40:07,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 66 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 14:40:07,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-12-14 14:40:07,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2022-12-14 14:40:07,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.234375) internal successors, (79), 72 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:07,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2022-12-14 14:40:07,301 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 29 [2022-12-14 14:40:07,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:40:07,301 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2022-12-14 14:40:07,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:07,301 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2022-12-14 14:40:07,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 14:40:07,301 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:40:07,302 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:40:07,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 14:40:07,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 14:40:07,502 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-12-14 14:40:07,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:40:07,502 INFO L85 PathProgramCache]: Analyzing trace with hash 218480003, now seen corresponding path program 1 times [2022-12-14 14:40:07,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:40:07,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512928187] [2022-12-14 14:40:07,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:40:07,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:40:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:40:07,838 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:40:07,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:40:07,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512928187] [2022-12-14 14:40:07,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512928187] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:40:07,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935366457] [2022-12-14 14:40:07,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:40:07,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:40:07,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:40:07,839 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:40:07,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 14:40:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:40:07,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-14 14:40:07,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:40:07,969 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 14:40:07,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 14:40:08,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:08,079 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:40:08,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-12-14 14:40:08,207 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:40:08,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2022-12-14 14:40:08,235 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 0 case distinctions, treesize of input 17 treesize of output 17 [2022-12-14 14:40:08,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:40:08,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:40:08,650 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:40:08,651 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 23 treesize of output 24 [2022-12-14 14:40:08,657 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:40:08,657 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 39 treesize of output 38 [2022-12-14 14:40:08,660 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 22 treesize of output 18 [2022-12-14 14:40:08,688 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:40:08,688 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 24 treesize of output 25 [2022-12-14 14:40:08,691 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:40:08,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:08,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:08,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-14 14:40:08,863 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:40:08,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 129 [2022-12-14 14:40:09,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:40:09,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935366457] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:40:09,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1071035341] [2022-12-14 14:40:09,039 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-12-14 14:40:09,039 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:40:09,039 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:40:09,039 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:40:09,039 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:40:09,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:09,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:09,053 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 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 14:40:09,082 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 15 treesize of output 1 [2022-12-14 14:40:09,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:09,088 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-14 14:40:09,095 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 15 treesize of output 1 [2022-12-14 14:40:09,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:09,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:09,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:09,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:09,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:09,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 14:40:09,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:09,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:09,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:09,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:09,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 14:40:09,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:09,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:09,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 14:40:09,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:09,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:09,283 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:40:09,284 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 260 treesize of output 242 [2022-12-14 14:40:09,308 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:40:09,308 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 260 treesize of output 242 [2022-12-14 14:40:09,322 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:40:09,356 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-12-14 14:40:09,356 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-12-14 14:40:09,617 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 14:40:09,680 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-12-14 14:40:09,681 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 33 [2022-12-14 14:40:09,779 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-12-14 14:40:09,779 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 33 [2022-12-14 14:40:09,855 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 15 treesize of output 1 [2022-12-14 14:40:09,859 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 15 treesize of output 1 [2022-12-14 14:40:09,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:09,864 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-14 14:40:09,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:09,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:09,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:09,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:09,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:09,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 14:40:09,886 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:40:12,927 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4438#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= |ULTIMATE.start_main_~flag~0#1| 1) (<= 0 |ULTIMATE.start_main_~flag~0#1|) (not (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 14:40:12,927 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:40:12,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:40:12,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2022-12-14 14:40:12,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400694417] [2022-12-14 14:40:12,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:40:12,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 14:40:12,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:40:12,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 14:40:12,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=2331, Unknown=3, NotChecked=0, Total=2756 [2022-12-14 14:40:12,929 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 34 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:13,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:40:13,583 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2022-12-14 14:40:13,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 14:40:13,583 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 14:40:13,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:40:13,583 INFO L225 Difference]: With dead ends: 139 [2022-12-14 14:40:13,583 INFO L226 Difference]: Without dead ends: 139 [2022-12-14 14:40:13,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1786 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=650, Invalid=3507, Unknown=3, NotChecked=0, Total=4160 [2022-12-14 14:40:13,584 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 259 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:40:13,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 344 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:40:13,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-12-14 14:40:13,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 97. [2022-12-14 14:40:13,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 96 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:13,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2022-12-14 14:40:13,586 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 30 [2022-12-14 14:40:13,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:40:13,587 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2022-12-14 14:40:13,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:13,587 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2022-12-14 14:40:13,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 14:40:13,587 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:40:13,587 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:40:13,591 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 14:40:13,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:40:13,789 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-12-14 14:40:13,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:40:13,790 INFO L85 PathProgramCache]: Analyzing trace with hash 218480004, now seen corresponding path program 1 times [2022-12-14 14:40:13,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:40:13,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326615080] [2022-12-14 14:40:13,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:40:13,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:40:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:40:14,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:40:14,119 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:40:14,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326615080] [2022-12-14 14:40:14,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326615080] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:40:14,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71373034] [2022-12-14 14:40:14,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:40:14,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:40:14,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:40:14,120 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:40:14,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 14:40:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:40:14,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-14 14:40:14,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:40:14,208 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:40:14,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:40:14,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:40:14,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:14,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:14,323 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:40:14,323 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 38 treesize of output 37 [2022-12-14 14:40:14,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 14:40:14,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-14 14:40:14,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 14:40:14,437 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:40:14,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:40:14,523 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_481 (Array Int Int)) (v_ArrVal_480 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_481) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (forall ((v_ArrVal_480 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2022-12-14 14:40:14,538 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_481 (Array Int Int)) (v_ArrVal_480 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_480) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_481) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (forall ((v_ArrVal_480 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_480) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) is different from false [2022-12-14 14:40:14,543 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:40:14,543 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 22 treesize of output 23 [2022-12-14 14:40:14,548 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:40:14,548 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 36 treesize of output 35 [2022-12-14 14:40:14,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 14:40:14,560 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:40:14,561 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 45 treesize of output 46 [2022-12-14 14:40:14,565 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:40:14,565 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-12-14 14:40:14,567 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:40:14,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:14,569 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-12-14 14:40:14,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:40:14,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:14,572 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-12-14 14:40:14,646 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:40:14,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-12-14 14:40:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-12-14 14:40:14,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71373034] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:40:14,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [891719508] [2022-12-14 14:40:14,759 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-12-14 14:40:14,759 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:40:14,759 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:40:14,759 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:40:14,759 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:40:14,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:14,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:14,775 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 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 14:40:14,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:14,811 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-14 14:40:14,818 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 15 treesize of output 1 [2022-12-14 14:40:14,823 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 15 treesize of output 1 [2022-12-14 14:40:14,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:14,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:14,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:14,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:14,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:14,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 14:40:14,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:14,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:14,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:14,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 14:40:14,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:14,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:14,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:14,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:14,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 14:40:14,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:15,013 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:40:15,013 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 260 treesize of output 242 [2022-12-14 14:40:15,028 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:40:15,068 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-12-14 14:40:15,068 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-12-14 14:40:15,096 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:40:15,096 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 256 treesize of output 238 [2022-12-14 14:40:15,549 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 14:40:15,599 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-12-14 14:40:15,599 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 33 [2022-12-14 14:40:15,673 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-12-14 14:40:15,673 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 33 [2022-12-14 14:40:15,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:15,753 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-14 14:40:15,761 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 15 treesize of output 1 [2022-12-14 14:40:15,767 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 15 treesize of output 1 [2022-12-14 14:40:15,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:15,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:15,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:15,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:15,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:15,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 14:40:15,794 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:40:18,442 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4918#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= |ULTIMATE.start_main_~flag~0#1| 1) (<= 0 |ULTIMATE.start_main_~flag~0#1|) (or (not (<= 0 |ULTIMATE.start_main_~p~0#1.offset|)) (not (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 14:40:18,442 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:40:18,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:40:18,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 26 [2022-12-14 14:40:18,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903496697] [2022-12-14 14:40:18,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:40:18,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 14:40:18,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:40:18,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 14:40:18,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1500, Unknown=2, NotChecked=166, Total=1980 [2022-12-14 14:40:18,445 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 27 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 27 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:19,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:40:19,239 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2022-12-14 14:40:19,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 14:40:19,240 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 27 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 14:40:19,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:40:19,241 INFO L225 Difference]: With dead ends: 149 [2022-12-14 14:40:19,241 INFO L226 Difference]: Without dead ends: 149 [2022-12-14 14:40:19,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=599, Invalid=2829, Unknown=2, NotChecked=230, Total=3660 [2022-12-14 14:40:19,243 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 294 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 77 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:40:19,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 308 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 461 Invalid, 3 Unknown, 188 Unchecked, 0.3s Time] [2022-12-14 14:40:19,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-12-14 14:40:19,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 100. [2022-12-14 14:40:19,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 91 states have (on average 1.1868131868131868) internal successors, (108), 99 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:19,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2022-12-14 14:40:19,247 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 30 [2022-12-14 14:40:19,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:40:19,247 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2022-12-14 14:40:19,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 27 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:19,247 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2022-12-14 14:40:19,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:40:19,248 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:40:19,248 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:40:19,252 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-14 14:40:19,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:40:19,448 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-12-14 14:40:19,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:40:19,449 INFO L85 PathProgramCache]: Analyzing trace with hash 487758996, now seen corresponding path program 1 times [2022-12-14 14:40:19,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:40:19,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303165997] [2022-12-14 14:40:19,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:40:19,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:40:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:40:19,738 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:40:19,738 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:40:19,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303165997] [2022-12-14 14:40:19,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303165997] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:40:19,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658610856] [2022-12-14 14:40:19,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:40:19,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:40:19,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:40:19,739 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:40:19,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 14:40:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:40:19,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-14 14:40:19,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:40:19,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:40:19,874 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:40:19,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:40:19,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:19,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:19,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 14:40:19,950 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 20 treesize of output 8 [2022-12-14 14:40:19,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:40:20,004 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:40:20,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:40:20,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:20,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:40:20,071 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 20 treesize of output 8 [2022-12-14 14:40:20,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:40:20,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 14:40:20,141 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:40:20,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:40:20,234 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_566 (Array Int Int))) (< (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_566) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2022-12-14 14:40:20,415 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 14:40:20,415 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 12 [2022-12-14 14:40:20,577 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:40:20,578 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2022-12-14 14:40:20,588 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 14:40:20,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 117 [2022-12-14 14:40:20,594 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 106 treesize of output 102 [2022-12-14 14:40:20,598 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 102 treesize of output 94 [2022-12-14 14:40:20,606 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 14:40:20,607 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 13 treesize of output 12 [2022-12-14 14:40:20,668 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 14:40:20,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658610856] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:40:20,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [576698617] [2022-12-14 14:40:20,670 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2022-12-14 14:40:20,670 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:40:20,670 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:40:20,670 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:40:20,670 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:40:20,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:20,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:20,684 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 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 14:40:20,711 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 15 treesize of output 1 [2022-12-14 14:40:20,717 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 15 treesize of output 1 [2022-12-14 14:40:20,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:20,723 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-14 14:40:20,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:20,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:20,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:20,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:20,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:20,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 14:40:20,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:20,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:20,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 14:40:20,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:20,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:20,826 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:40:20,827 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 34 treesize of output 16 [2022-12-14 14:40:20,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:20,836 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 34 treesize of output 16 [2022-12-14 14:40:20,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:20,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:20,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:20,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-12-14 14:40:20,950 INFO L321 Elim1Store]: treesize reduction 138, result has 17.9 percent of original size [2022-12-14 14:40:20,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 286 treesize of output 294 [2022-12-14 14:40:21,085 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-12-14 14:40:21,086 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 371 treesize of output 320 [2022-12-14 14:40:21,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:21,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:21,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:21,102 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:40:21,109 INFO L321 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2022-12-14 14:40:21,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 317 treesize of output 298 [2022-12-14 14:40:21,139 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-12-14 14:40:21,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 311 treesize of output 308 [2022-12-14 14:40:21,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:21,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:21,457 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 14:40:21,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 33 treesize of output 46 [2022-12-14 14:40:21,480 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:40:21,480 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 34 treesize of output 16 [2022-12-14 14:40:21,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:21,490 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 34 treesize of output 16 [2022-12-14 14:40:21,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:40:21,553 INFO L321 Elim1Store]: treesize reduction 94, result has 21.0 percent of original size [2022-12-14 14:40:21,553 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 3 case distinctions, treesize of input 245 treesize of output 149 [2022-12-14 14:40:21,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:21,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:21,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:21,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:21,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:21,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:21,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-12-14 14:40:21,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:21,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:21,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:21,589 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 78 [2022-12-14 14:40:21,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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 14:40:21,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:40:21,635 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 19 treesize of output 1 [2022-12-14 14:40:21,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:21,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:21,705 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:40:21,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 16 [2022-12-14 14:40:21,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:21,714 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 34 treesize of output 16 [2022-12-14 14:40:21,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:40:21,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:40:21,762 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:40:21,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 16 [2022-12-14 14:40:21,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:21,771 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 34 treesize of output 16 [2022-12-14 14:40:21,791 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 9 [2022-12-14 14:40:21,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:40:21,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:21,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:21,822 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 19 treesize of output 1 [2022-12-14 14:40:21,876 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 15 treesize of output 1 [2022-12-14 14:40:21,881 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 15 treesize of output 1 [2022-12-14 14:40:21,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:40:21,996 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 14:40:21,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 21 [2022-12-14 14:40:22,042 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:40:23,636 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5435#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< |ULTIMATE.start_main_~p~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 0) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (= |ULTIMATE.start_main_~flag~0#1| 1) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_#res#1| 0) (= |#NULL.base| 0))' at error location [2022-12-14 14:40:23,637 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:40:23,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:40:23,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 14] total 37 [2022-12-14 14:40:23,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121839353] [2022-12-14 14:40:23,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:40:23,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-14 14:40:23,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:40:23,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-14 14:40:23,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=2274, Unknown=23, NotChecked=98, Total=2652 [2022-12-14 14:40:23,638 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 37 states, 37 states have (on average 2.2432432432432434) internal successors, (83), 37 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:24,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:40:24,257 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2022-12-14 14:40:24,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 14:40:24,258 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.2432432432432434) internal successors, (83), 37 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 14:40:24,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:40:24,258 INFO L225 Difference]: With dead ends: 95 [2022-12-14 14:40:24,258 INFO L226 Difference]: Without dead ends: 95 [2022-12-14 14:40:24,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1087 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=471, Invalid=3415, Unknown=24, NotChecked=122, Total=4032 [2022-12-14 14:40:24,259 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 107 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:40:24,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 334 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 504 Invalid, 0 Unknown, 54 Unchecked, 0.3s Time] [2022-12-14 14:40:24,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-12-14 14:40:24,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2022-12-14 14:40:24,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 75 states have (on average 1.1866666666666668) internal successors, (89), 83 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:24,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2022-12-14 14:40:24,261 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 31 [2022-12-14 14:40:24,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:40:24,261 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2022-12-14 14:40:24,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.2432432432432434) internal successors, (83), 37 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:24,261 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-12-14 14:40:24,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 14:40:24,261 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:40:24,261 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:40:24,266 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 14:40:24,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-14 14:40:24,463 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-12-14 14:40:24,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:40:24,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1862398896, now seen corresponding path program 1 times [2022-12-14 14:40:24,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:40:24,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385253090] [2022-12-14 14:40:24,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:40:24,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:40:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:40:24,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:40:24,801 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:40:24,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385253090] [2022-12-14 14:40:24,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385253090] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:40:24,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533803887] [2022-12-14 14:40:24,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:40:24,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:40:24,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:40:24,802 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:40:24,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 14:40:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:40:24,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-14 14:40:24,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:40:24,914 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:40:24,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:40:24,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:24,974 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:40:24,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-12-14 14:40:25,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-14 14:40:25,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:40:25,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:40:25,079 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_615 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_615) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_#StackHeapBarrier|)) is different from false [2022-12-14 14:40:25,086 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_615 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_615) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_#StackHeapBarrier|)) is different from false [2022-12-14 14:40:25,090 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:40:25,091 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 22 treesize of output 23 [2022-12-14 14:40:25,095 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:40:25,096 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 36 treesize of output 35 [2022-12-14 14:40:25,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 14:40:25,158 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:40:25,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-12-14 14:40:25,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-12-14 14:40:25,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533803887] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:40:25,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2026036106] [2022-12-14 14:40:25,230 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2022-12-14 14:40:25,230 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:40:25,230 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:40:25,230 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:40:25,230 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:40:25,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:25,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:25,249 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 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 14:40:25,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:25,271 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-14 14:40:25,275 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 15 treesize of output 1 [2022-12-14 14:40:25,279 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 15 treesize of output 1 [2022-12-14 14:40:25,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:25,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:25,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:25,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:25,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:25,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 14:40:25,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:25,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:25,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:25,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 14:40:25,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:25,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:25,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:25,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 14:40:25,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:25,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:25,440 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:40:25,440 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 260 treesize of output 242 [2022-12-14 14:40:25,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:40:25,479 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-12-14 14:40:25,479 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-12-14 14:40:25,502 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:40:25,502 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 256 treesize of output 238 [2022-12-14 14:40:25,941 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-12-14 14:40:25,985 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-12-14 14:40:25,986 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 33 [2022-12-14 14:40:26,052 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-12-14 14:40:26,053 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 33 [2022-12-14 14:40:26,137 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 15 treesize of output 1 [2022-12-14 14:40:26,141 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 15 treesize of output 1 [2022-12-14 14:40:26,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:26,147 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-14 14:40:26,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:26,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:26,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:26,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:26,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:26,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 14:40:26,170 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:40:28,640 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5868#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= |ULTIMATE.start_main_~flag~0#1| 1) (<= 0 |ULTIMATE.start_main_~flag~0#1|) (not (< |ULTIMATE.start_main_~p~0#1.base| |#StackHeapBarrier|)) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 14:40:28,640 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:40:28,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:40:28,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2022-12-14 14:40:28,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288461836] [2022-12-14 14:40:28,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:40:28,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 14:40:28,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:40:28,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 14:40:28,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=1366, Unknown=2, NotChecked=158, Total=1806 [2022-12-14 14:40:28,642 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:29,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:40:29,070 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2022-12-14 14:40:29,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 14:40:29,070 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-12-14 14:40:29,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:40:29,071 INFO L225 Difference]: With dead ends: 129 [2022-12-14 14:40:29,071 INFO L226 Difference]: Without dead ends: 129 [2022-12-14 14:40:29,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 59 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=425, Invalid=2030, Unknown=3, NotChecked=194, Total=2652 [2022-12-14 14:40:29,072 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 180 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 36 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 214 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:40:29,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 281 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 452 Invalid, 1 Unknown, 214 Unchecked, 0.2s Time] [2022-12-14 14:40:29,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-12-14 14:40:29,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 85. [2022-12-14 14:40:29,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 84 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:29,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2022-12-14 14:40:29,074 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 33 [2022-12-14 14:40:29,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:40:29,074 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2022-12-14 14:40:29,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:29,074 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2022-12-14 14:40:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 14:40:29,074 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:40:29,074 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:40:29,079 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 14:40:29,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:40:29,276 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-12-14 14:40:29,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:40:29,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1862401458, now seen corresponding path program 1 times [2022-12-14 14:40:29,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:40:29,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275439317] [2022-12-14 14:40:29,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:40:29,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:40:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:40:29,542 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:40:29,542 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:40:29,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275439317] [2022-12-14 14:40:29,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275439317] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:40:29,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816318814] [2022-12-14 14:40:29,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:40:29,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:40:29,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:40:29,544 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:40:29,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 14:40:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:40:29,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-14 14:40:29,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:40:29,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:40:29,683 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:40:29,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:40:29,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:29,776 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:40:29,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-12-14 14:40:29,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-14 14:40:29,868 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 9 [2022-12-14 14:40:29,873 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:40:29,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:40:29,983 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:40:29,984 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 24 treesize of output 25 [2022-12-14 14:40:29,988 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:40:29,988 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 40 treesize of output 39 [2022-12-14 14:40:29,990 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 9 treesize of output 5 [2022-12-14 14:40:30,044 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 18 treesize of output 16 [2022-12-14 14:40:30,098 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:40:30,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-12-14 14:40:30,148 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:40:30,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816318814] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:40:30,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [767250927] [2022-12-14 14:40:30,149 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-12-14 14:40:30,149 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:40:30,150 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:40:30,150 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:40:30,150 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:40:30,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:30,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:30,161 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 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 14:40:30,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:30,181 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-14 14:40:30,185 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 15 treesize of output 1 [2022-12-14 14:40:30,189 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 15 treesize of output 1 [2022-12-14 14:40:30,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:30,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:30,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:30,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:30,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:30,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 14:40:30,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:30,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:30,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:30,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 14:40:30,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:30,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:30,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:30,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:30,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 14:40:30,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:30,339 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:40:30,367 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-12-14 14:40:30,367 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-12-14 14:40:30,391 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:40:30,392 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 256 treesize of output 238 [2022-12-14 14:40:30,413 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:40:30,414 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 256 treesize of output 238 [2022-12-14 14:40:30,856 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-12-14 14:40:30,901 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-12-14 14:40:30,902 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 33 [2022-12-14 14:40:30,963 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-12-14 14:40:30,963 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 33 [2022-12-14 14:40:31,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:31,049 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-14 14:40:31,056 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 15 treesize of output 1 [2022-12-14 14:40:31,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 14:40:31,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:31,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:31,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:31,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:31,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:31,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 14:40:31,080 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:40:33,755 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6346#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= |ULTIMATE.start_main_~flag~0#1| 1) (<= 0 |ULTIMATE.start_main_~flag~0#1|) (exists ((|v_ULTIMATE.start_main_~p~0#1.offset_178| Int) (|v_ULTIMATE.start_main_~p~0#1.base_198| Int)) (and (= (select |#valid| |v_ULTIMATE.start_main_~p~0#1.base_198|) 1) (<= (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_178|) (select |#length| |v_ULTIMATE.start_main_~p~0#1.base_198|)) (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_178|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~p~0#1.base_198|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_178|)) |ULTIMATE.start_main_~p~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~p~0#1.base_198|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_178|)) |ULTIMATE.start_main_~p~0#1.base|))) (<= 0 |ULTIMATE.start_main_~tmp~0#1.offset|) (= |#NULL.offset| 0) (not (= |ULTIMATE.start_main_~tmp~0#1.offset| 0)) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 14:40:33,755 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:40:33,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:40:33,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2022-12-14 14:40:33,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531072149] [2022-12-14 14:40:33,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:40:33,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 14:40:33,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:40:33,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 14:40:33,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=2145, Unknown=4, NotChecked=0, Total=2550 [2022-12-14 14:40:33,757 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 33 states, 32 states have (on average 2.8125) internal successors, (90), 32 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:34,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:40:34,338 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2022-12-14 14:40:34,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 14:40:34,338 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.8125) internal successors, (90), 32 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-12-14 14:40:34,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:40:34,339 INFO L225 Difference]: With dead ends: 130 [2022-12-14 14:40:34,339 INFO L226 Difference]: Without dead ends: 130 [2022-12-14 14:40:34,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 53 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1809 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=722, Invalid=3830, Unknown=4, NotChecked=0, Total=4556 [2022-12-14 14:40:34,340 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 457 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:40:34,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 421 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:40:34,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-12-14 14:40:34,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 86. [2022-12-14 14:40:34,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 85 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:34,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2022-12-14 14:40:34,342 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 33 [2022-12-14 14:40:34,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:40:34,342 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2022-12-14 14:40:34,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.8125) internal successors, (90), 32 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:34,342 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-12-14 14:40:34,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 14:40:34,342 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:40:34,342 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, 1, 1, 1, 1, 1, 1] [2022-12-14 14:40:34,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-14 14:40:34,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-14 14:40:34,544 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-12-14 14:40:34,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:40:34,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1899870503, now seen corresponding path program 1 times [2022-12-14 14:40:34,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:40:34,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218850877] [2022-12-14 14:40:34,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:40:34,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:40:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:40:34,854 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:40:34,854 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:40:34,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218850877] [2022-12-14 14:40:34,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218850877] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:40:34,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705252362] [2022-12-14 14:40:34,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:40:34,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:40:34,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:40:34,855 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:40:34,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 14:40:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:40:34,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-14 14:40:34,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:40:34,970 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:40:34,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:40:34,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:35,052 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:40:35,052 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 26 treesize of output 27 [2022-12-14 14:40:35,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-14 14:40:35,199 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:40:35,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:40:35,333 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:40:35,333 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 22 treesize of output 23 [2022-12-14 14:40:35,338 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:40:35,338 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 36 treesize of output 35 [2022-12-14 14:40:35,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 7 treesize of output 3 [2022-12-14 14:40:35,424 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:40:35,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-12-14 14:40:35,519 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:40:35,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705252362] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:40:35,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1415451608] [2022-12-14 14:40:35,520 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-12-14 14:40:35,520 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:40:35,520 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:40:35,520 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:40:35,520 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:40:35,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:35,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:35,531 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 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 14:40:35,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:35,553 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-14 14:40:35,558 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 15 treesize of output 1 [2022-12-14 14:40:35,563 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 15 treesize of output 1 [2022-12-14 14:40:35,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:35,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:35,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:35,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:35,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:35,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 14:40:35,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:35,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:35,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:35,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:35,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 14:40:35,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:35,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:35,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 14:40:35,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:35,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:35,731 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:40:35,731 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 260 treesize of output 242 [2022-12-14 14:40:35,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:40:35,767 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-12-14 14:40:35,767 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-12-14 14:40:35,785 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:40:35,785 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 256 treesize of output 238 [2022-12-14 14:40:35,994 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 14:40:36,044 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-12-14 14:40:36,044 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 33 [2022-12-14 14:40:36,130 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-12-14 14:40:36,131 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 33 [2022-12-14 14:40:36,225 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 15 treesize of output 1 [2022-12-14 14:40:36,230 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 15 treesize of output 1 [2022-12-14 14:40:36,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:36,235 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-14 14:40:36,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:36,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:36,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:36,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:36,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:40:36,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 14:40:36,260 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:40:39,149 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6847#(and (or (and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~flag~0#1| 1) (= |#NULL.base| 0)) (and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~t~0#1.offset| 0) (= |#NULL.base| 0))) (not (< |ULTIMATE.start_main_~tmp~0#1.base| |#StackHeapBarrier|)) (<= |ULTIMATE.start_main_~flag~0#1| 1) (= |ULTIMATE.start_main_~tmp~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~flag~0#1|) (<= |#NULL.offset| 0) (exists ((|v_ULTIMATE.start_main_~p~0#1.base_217| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_194| Int)) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~p~0#1.base_217|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_194|)) |ULTIMATE.start_main_~p~0#1.offset|) (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_194|) (= (select |#valid| |v_ULTIMATE.start_main_~p~0#1.base_217|) 1) (<= (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_194|) (select |#length| |v_ULTIMATE.start_main_~p~0#1.base_217|)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~p~0#1.base_217|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_194|)) |ULTIMATE.start_main_~p~0#1.base|))) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-12-14 14:40:39,149 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:40:39,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:40:39,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 34 [2022-12-14 14:40:39,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431642895] [2022-12-14 14:40:39,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:40:39,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 14:40:39,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:40:39,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 14:40:39,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=2385, Unknown=0, NotChecked=0, Total=2756 [2022-12-14 14:40:39,150 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 35 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 34 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:39,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:40:39,817 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2022-12-14 14:40:39,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 14:40:39,818 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 34 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-12-14 14:40:39,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:40:39,818 INFO L225 Difference]: With dead ends: 107 [2022-12-14 14:40:39,818 INFO L226 Difference]: Without dead ends: 107 [2022-12-14 14:40:39,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=610, Invalid=3946, Unknown=0, NotChecked=0, Total=4556 [2022-12-14 14:40:39,819 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 236 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:40:39,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 434 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:40:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-12-14 14:40:39,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2022-12-14 14:40:39,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 75 states have (on average 1.1733333333333333) internal successors, (88), 83 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:39,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-12-14 14:40:39,821 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 34 [2022-12-14 14:40:39,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:40:39,821 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-12-14 14:40:39,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 34 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:39,821 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-12-14 14:40:39,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 14:40:39,821 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:40:39,821 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:40:39,825 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 14:40:40,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:40:40,023 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-12-14 14:40:40,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:40:40,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1236018122, now seen corresponding path program 1 times [2022-12-14 14:40:40,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:40:40,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713734272] [2022-12-14 14:40:40,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:40:40,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:40:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:40:40,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:40:40,534 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:40:40,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713734272] [2022-12-14 14:40:40,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713734272] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:40:40,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274667942] [2022-12-14 14:40:40,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:40:40,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:40:40,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:40:40,535 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:40:40,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 14:40:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:40:40,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 14:40:40,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:40:40,714 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-12-14 14:40:40,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 44 [2022-12-14 14:40:40,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:40:40,861 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:40:40,861 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 49 treesize of output 46 [2022-12-14 14:40:41,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2022-12-14 14:40:41,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 22 [2022-12-14 14:40:41,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:40:41,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:40:41,366 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_767 (Array Int Int))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_767) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2022-12-14 14:40:41,373 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_767 (Array Int Int))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_767) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2022-12-14 14:40:41,377 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:40:41,378 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 32 treesize of output 33 [2022-12-14 14:40:41,383 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:40:41,383 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 56 treesize of output 55 [2022-12-14 14:40:41,386 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 17 [2022-12-14 14:41:11,636 WARN L233 SmtUtils]: Spent 24.12s on a formula simplification. DAG size of input: 42 DAG size of output: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:41:35,837 WARN L233 SmtUtils]: Spent 24.08s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:42:08,048 WARN L233 SmtUtils]: Spent 32.11s on a formula simplification. DAG size of input: 55 DAG size of output: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:42:16,250 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:42:16,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-12-14 14:42:16,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274667942] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:42:16,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [506305501] [2022-12-14 14:42:16,270 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-12-14 14:42:16,270 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:42:16,270 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:42:16,270 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:42:16,271 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:42:16,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:16,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:16,287 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 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 14:42:16,308 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 15 treesize of output 1 [2022-12-14 14:42:16,312 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 15 treesize of output 1 [2022-12-14 14:42:16,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:16,318 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-14 14:42:16,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:16,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:16,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:16,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:16,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:16,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 14:42:16,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:42:16,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:16,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:16,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 14:42:16,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:42:16,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:42:16,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:16,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:16,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 14:42:16,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:42:16,490 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:42:16,519 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-12-14 14:42:16,520 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-12-14 14:42:16,542 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:42:16,542 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 256 treesize of output 238 [2022-12-14 14:42:16,562 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:42:16,562 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 256 treesize of output 238 [2022-12-14 14:42:16,777 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-12-14 14:42:16,837 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-12-14 14:42:16,838 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 33 [2022-12-14 14:42:16,934 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-12-14 14:42:16,935 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 33 [2022-12-14 14:42:16,964 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 14:42:17,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:17,029 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-14 14:42:17,035 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 15 treesize of output 1 [2022-12-14 14:42:17,040 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 15 treesize of output 1 [2022-12-14 14:42:17,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:17,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:17,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:17,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:17,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:17,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 14:42:17,067 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:42:20,328 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7327#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< |ULTIMATE.start_main_~p~0#1.base| |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~flag~0#1| 1) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (<= 0 |ULTIMATE.start_main_~flag~0#1|) (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 0) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_#res#1| 0) (= |#NULL.base| 0))' at error location [2022-12-14 14:42:20,328 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:42:20,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:42:20,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 35 [2022-12-14 14:42:20,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763616674] [2022-12-14 14:42:20,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:42:20,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-14 14:42:20,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:42:20,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-14 14:42:20,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=2983, Unknown=5, NotChecked=226, Total=3540 [2022-12-14 14:42:20,330 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 37 states, 36 states have (on average 2.6944444444444446) internal successors, (97), 36 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:21,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:42:21,221 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-12-14 14:42:21,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 14:42:21,222 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.6944444444444446) internal successors, (97), 36 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-12-14 14:42:21,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:42:21,222 INFO L225 Difference]: With dead ends: 93 [2022-12-14 14:42:21,222 INFO L226 Difference]: Without dead ends: 71 [2022-12-14 14:42:21,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1703 ImplicationChecksByTransitivity, 98.9s TimeCoverageRelationStatistics Valid=417, Invalid=3746, Unknown=5, NotChecked=254, Total=4422 [2022-12-14 14:42:21,224 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 87 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:42:21,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 328 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 548 Invalid, 0 Unknown, 113 Unchecked, 0.4s Time] [2022-12-14 14:42:21,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-12-14 14:42:21,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2022-12-14 14:42:21,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 63 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:21,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2022-12-14 14:42:21,225 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 35 [2022-12-14 14:42:21,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:42:21,225 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2022-12-14 14:42:21,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.6944444444444446) internal successors, (97), 36 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:21,226 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-12-14 14:42:21,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 14:42:21,226 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:42:21,226 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:42:21,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-14 14:42:21,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-14 14:42:21,428 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-12-14 14:42:21,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:42:21,429 INFO L85 PathProgramCache]: Analyzing trace with hash -403151837, now seen corresponding path program 1 times [2022-12-14 14:42:21,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:42:21,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124741969] [2022-12-14 14:42:21,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:42:21,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:42:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:42:21,831 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:42:21,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:42:21,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124741969] [2022-12-14 14:42:21,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124741969] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:42:21,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019518841] [2022-12-14 14:42:21,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:42:21,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:42:21,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:42:21,833 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:42:21,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 14:42:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:42:21,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-14 14:42:21,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:42:21,950 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 14:42:21,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 14:42:21,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:42:22,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:42:22,111 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:42:22,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-12-14 14:42:22,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:42:22,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:22,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-12-14 14:42:22,176 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-12-14 14:42:22,176 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 20 treesize of output 22 [2022-12-14 14:42:22,250 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 14:42:22,250 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 25 [2022-12-14 14:42:22,254 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 11 treesize of output 7 [2022-12-14 14:42:22,261 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:42:22,267 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 14:42:22,268 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 37 treesize of output 28 [2022-12-14 14:42:22,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 14:42:22,406 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-14 14:42:22,407 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 116 treesize of output 99 [2022-12-14 14:42:22,415 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:42:22,416 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 110 treesize of output 103 [2022-12-14 14:42:22,419 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 38 [2022-12-14 14:42:22,512 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:42:22,516 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:42:22,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 30 [2022-12-14 14:42:22,519 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 33 treesize of output 17 [2022-12-14 14:42:22,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 14:42:22,560 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:42:22,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:42:22,622 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_858 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (not (= 3 (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_858) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_860) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) is different from false [2022-12-14 14:42:22,634 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_858 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (not (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_858) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_860) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_859) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 3))) is different from false [2022-12-14 14:42:22,799 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:42:22,799 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 57 [2022-12-14 14:42:22,808 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:42:22,808 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 66 [2022-12-14 14:42:22,819 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:42:22,819 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 121 treesize of output 124 [2022-12-14 14:42:22,825 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 76 treesize of output 58 [2022-12-14 14:42:22,853 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 30 treesize of output 22 [2022-12-14 14:42:23,150 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:42:23,150 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 118 treesize of output 109 [2022-12-14 14:42:23,158 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:42:23,158 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 98 treesize of output 99 [2022-12-14 14:42:23,167 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:42:23,167 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 207 treesize of output 146 [2022-12-14 14:42:23,171 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 126 treesize of output 118 [2022-12-14 14:42:23,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 114 [2022-12-14 14:42:23,186 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:42:23,186 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 253 treesize of output 246 [2022-12-14 14:42:23,192 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 230 treesize of output 222 [2022-12-14 14:42:23,198 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 222 treesize of output 214 [2022-12-14 14:42:23,209 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:42:23,209 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 214 treesize of output 199 [2022-12-14 14:42:23,220 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:42:23,221 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 190 treesize of output 159 [2022-12-14 14:42:23,867 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:42:23,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 107 treesize of output 255 [2022-12-14 14:42:25,085 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2022-12-14 14:42:25,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019518841] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:42:25,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1488929260] [2022-12-14 14:42:25,086 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-12-14 14:42:25,086 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:42:25,086 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:42:25,086 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:42:25,086 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:42:25,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:25,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:25,104 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 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 14:42:25,126 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 15 treesize of output 1 [2022-12-14 14:42:25,131 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 15 treesize of output 1 [2022-12-14 14:42:25,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:25,136 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-14 14:42:25,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:25,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:25,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:25,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:25,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:25,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 14:42:25,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:25,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:25,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 14:42:25,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:42:25,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:42:25,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:25,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:25,232 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 14:42:25,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 33 treesize of output 46 [2022-12-14 14:42:25,251 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:42:25,251 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 34 treesize of output 16 [2022-12-14 14:42:25,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:25,261 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 34 treesize of output 16 [2022-12-14 14:42:25,342 INFO L321 Elim1Store]: treesize reduction 142, result has 15.5 percent of original size [2022-12-14 14:42:25,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 351 treesize of output 351 [2022-12-14 14:42:25,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:42:25,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:42:25,443 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 19 treesize of output 1 [2022-12-14 14:42:25,526 INFO L321 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2022-12-14 14:42:25,527 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 3 case distinctions, treesize of input 138 treesize of output 129 [2022-12-14 14:42:25,563 INFO L321 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2022-12-14 14:42:25,563 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 3 case distinctions, treesize of input 126 treesize of output 117 [2022-12-14 14:42:25,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:42:25,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:25,626 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 34 treesize of output 16 [2022-12-14 14:42:25,640 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:42:25,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 16 [2022-12-14 14:42:25,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:42:25,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:42:25,662 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 9 [2022-12-14 14:42:25,673 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 19 treesize of output 1 [2022-12-14 14:42:25,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:42:25,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:42:25,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:25,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2022-12-14 14:42:25,716 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:42:25,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 16 [2022-12-14 14:42:25,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:42:25,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:25,736 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 34 treesize of output 16 [2022-12-14 14:42:25,749 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:42:25,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 16 [2022-12-14 14:42:25,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:42:25,801 INFO L321 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2022-12-14 14:42:25,801 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 6 case distinctions, treesize of input 180 treesize of output 194 [2022-12-14 14:42:25,856 INFO L321 Elim1Store]: treesize reduction 62, result has 41.5 percent of original size [2022-12-14 14:42:25,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 181 treesize of output 213 [2022-12-14 14:42:26,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:42:26,014 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 19 treesize of output 1 [2022-12-14 14:42:26,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:42:26,106 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-12-14 14:42:26,106 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 171 treesize of output 163 [2022-12-14 14:42:26,137 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-12-14 14:42:26,138 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 159 treesize of output 151 [2022-12-14 14:42:26,162 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-12-14 14:42:26,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 143 treesize of output 149 [2022-12-14 14:42:26,840 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-12-14 14:42:26,890 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-12-14 14:42:26,890 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 33 [2022-12-14 14:42:26,970 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-12-14 14:42:26,970 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 33 [2022-12-14 14:42:27,079 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-12-14 14:42:27,080 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 182 treesize of output 174 [2022-12-14 14:42:27,107 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-12-14 14:42:27,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 162 [2022-12-14 14:42:27,128 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-12-14 14:42:27,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 154 treesize of output 160 [2022-12-14 14:42:27,240 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:42:27,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 16 [2022-12-14 14:42:27,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:27,247 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 34 treesize of output 16 [2022-12-14 14:42:27,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:42:27,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:42:27,278 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 9 [2022-12-14 14:42:27,280 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:42:29,798 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7786#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= |ULTIMATE.start_main_~flag~0#1| 1) (<= 0 |ULTIMATE.start_main_~flag~0#1|) (not (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 14:42:29,798 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:42:29,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:42:29,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 41 [2022-12-14 14:42:29,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970591898] [2022-12-14 14:42:29,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:42:29,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-14 14:42:29,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:42:29,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-14 14:42:29,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=3226, Unknown=5, NotChecked=234, Total=3782 [2022-12-14 14:42:29,800 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 42 states, 42 states have (on average 2.4761904761904763) internal successors, (104), 41 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:37,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:42:40,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:42:40,878 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2022-12-14 14:42:40,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-14 14:42:40,878 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.4761904761904763) internal successors, (104), 41 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-12-14 14:42:40,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:42:40,879 INFO L225 Difference]: With dead ends: 120 [2022-12-14 14:42:40,879 INFO L226 Difference]: Without dead ends: 102 [2022-12-14 14:42:40,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 91 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2522 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=827, Invalid=7349, Unknown=22, NotChecked=358, Total=8556 [2022-12-14 14:42:40,880 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 255 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 127 mSolverCounterUnsat, 35 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 35 IncrementalHoareTripleChecker+Unknown, 180 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:42:40,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 559 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 976 Invalid, 35 Unknown, 180 Unchecked, 4.5s Time] [2022-12-14 14:42:40,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-12-14 14:42:40,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 80. [2022-12-14 14:42:40,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:40,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-12-14 14:42:40,881 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 38 [2022-12-14 14:42:40,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:42:40,882 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-12-14 14:42:40,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.4761904761904763) internal successors, (104), 41 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:40,882 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-12-14 14:42:40,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 14:42:40,882 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:42:40,882 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:42:40,886 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 14:42:41,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-14 14:42:41,083 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-12-14 14:42:41,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:42:41,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1434091777, now seen corresponding path program 2 times [2022-12-14 14:42:41,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:42:41,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586671830] [2022-12-14 14:42:41,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:42:41,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:42:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:42:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:42:41,824 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:42:41,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586671830] [2022-12-14 14:42:41,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586671830] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:42:41,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838945398] [2022-12-14 14:42:41,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:42:41,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:42:41,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:42:41,825 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:42:41,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a21e6e-d866-49bf-9134-83cbea9f68bd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 14:42:41,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 14:42:41,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:42:41,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 92 conjunts are in the unsatisfiable core [2022-12-14 14:42:41,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:42:41,999 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:42:41,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:42:42,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:42:42,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:42:42,093 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 14:42:42,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-14 14:42:42,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 14:42:42,106 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:42:42,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-12-14 14:42:42,141 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:42:42,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:42:42,180 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 14:42:42,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-14 14:42:42,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 14:42:42,197 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 14:42:42,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 24 [2022-12-14 14:42:42,321 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 14:42:42,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-14 14:42:42,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 14:42:42,339 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-12-14 14:42:42,339 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 3 case distinctions, treesize of input 51 treesize of output 53 [2022-12-14 14:42:42,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-12-14 14:42:42,427 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-12-14 14:42:42,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-12-14 14:42:42,522 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 14:42:42,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 14:42:42,556 INFO L321 Elim1Store]: treesize reduction 54, result has 31.6 percent of original size [2022-12-14 14:42:42,556 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 3 case distinctions, treesize of input 75 treesize of output 62 [2022-12-14 14:42:42,822 INFO L321 Elim1Store]: treesize reduction 50, result has 39.0 percent of original size [2022-12-14 14:42:42,822 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 6 case distinctions, treesize of input 179 treesize of output 155 [2022-12-14 14:42:42,868 INFO L321 Elim1Store]: treesize reduction 74, result has 43.9 percent of original size [2022-12-14 14:42:42,869 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 127 treesize of output 153 [2022-12-14 14:42:42,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:42:42,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 14:42:43,013 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 18 treesize of output 10 [2022-12-14 14:42:43,388 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:42:43,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 359 treesize of output 381 [2022-12-14 14:42:43,521 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 19 treesize of output 11 [2022-12-14 14:42:43,544 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 19 treesize of output 11 [2022-12-14 14:42:43,571 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 19 treesize of output 11 [2022-12-14 14:42:44,338 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 62 treesize of output 50 [2022-12-14 14:42:44,353 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 77 treesize of output 63 [2022-12-14 14:42:44,396 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 62 treesize of output 50 [2022-12-14 14:42:44,411 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 81 treesize of output 69 [2022-12-14 14:42:44,829 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 63 treesize of output 51 [2022-12-14 14:42:44,874 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 133 treesize of output 113 [2022-12-14 14:42:49,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:42:49,272 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:42:49,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 173 treesize of output 167 [2022-12-14 14:42:49,910 INFO L321 Elim1Store]: treesize reduction 4, result has 97.1 percent of original size [2022-12-14 14:42:49,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 136 treesize of output 212 [2022-12-14 14:42:52,350 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 14:42:52,350 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 57 treesize of output 24 [2022-12-14 14:42:52,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 14:42:52,361 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:42:52,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:42:52,770 INFO L321 Elim1Store]: treesize reduction 4, result has 86.2 percent of original size [2022-12-14 14:42:52,770 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 96 treesize of output 95 [2022-12-14 14:42:53,534 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:42:53,535 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-12-14 14:42:53,541 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:42:53,542 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2022-12-14 14:42:53,557 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:42:53,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 44 [2022-12-14 14:42:53,572 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:42:53,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-12-14 14:42:53,579 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:42:53,579 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2022-12-14 14:42:54,401 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:42:54,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 310 treesize of output 494 [2022-12-14 14:42:54,696 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 50 treesize of output 42 [2022-12-14 14:42:54,721 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 57 treesize of output 45 [2022-12-14 14:42:54,766 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 41 treesize of output 33 [2022-12-14 14:42:54,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 14:42:54,981 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 46 treesize of output 38 [2022-12-14 14:42:55,010 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 46 treesize of output 38 [2022-12-14 14:42:55,445 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 19 treesize of output 11 [2022-12-14 14:42:55,512 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 11 treesize of output 7 [2022-12-14 14:42:55,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2022-12-14 14:42:55,723 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 35 treesize of output 23 [2022-12-14 14:42:55,881 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 45 treesize of output 37 [2022-12-14 14:42:55,928 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 52 treesize of output 40 [2022-12-14 14:42:55,965 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 45 treesize of output 37 [2022-12-14 14:42:56,019 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 291 treesize of output 275 [2022-12-14 14:42:56,741 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 30 treesize of output 18 [2022-12-14 14:42:56,771 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 63 treesize of output 47 [2022-12-14 14:42:56,840 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 56 treesize of output 44 [2022-12-14 14:42:56,998 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 57 treesize of output 45 [2022-12-14 14:42:57,008 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 45 treesize of output 37 [2022-12-14 14:42:57,059 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 19 treesize of output 11 [2022-12-14 14:42:57,152 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-14 14:42:57,213 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 46 treesize of output 38 [2022-12-14 14:42:57,562 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 23 treesize of output 15 [2022-12-14 14:42:57,702 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 208 treesize of output 196 [2022-12-14 14:42:57,832 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 215 treesize of output 199 [2022-12-14 14:42:57,962 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 182 treesize of output 170 [2022-12-14 14:43:03,482 WARN L859 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_main_~a~0#1.offset| 0) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|))) (let ((.cse15 (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse187 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse187) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse188 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse188 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse187 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse190 (+ 4 v_subst_2))) (let ((.cse189 (select v_arrayElimArr_19 .cse190))) (or (not (= (select (select (store (store .cse188 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse189 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse187 .cse189) (not (= (select v_arrayElimArr_20 .cse190) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse189 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse189)))))))))))) (.cse55 (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse183 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse184 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse182 (select (select (store (store .cse184 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse183 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse182) (= .cse183 .cse182) (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse186 (+ 4 v_subst_2))) (let ((.cse185 (select v_arrayElimArr_19 .cse186))) (or (not (= (select (select (store (store .cse184 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse185 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse183 .cse185) (not (= (select v_arrayElimArr_20 .cse186) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse185 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse185))))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse183))))) (.cse16 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse0 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse0) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse0 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse3 (+ 4 v_subst_1))) (let ((.cse4 (select v_arrayElimArr_22 .cse3))) (or (not (= (select v_arrayElimArr_23 .cse3) 0)) (not (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse4 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse4 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse4) (= .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))))))))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse10 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse9 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse10 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_23 (Array Int Int)) (v_subst_1 Int)) (let ((.cse6 (+ 4 v_subst_1))) (or (not (= (select v_arrayElimArr_23 .cse6) 0)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse8 (select v_arrayElimArr_22 .cse6))) (or (not (= (select (select (store (store .cse7 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse8 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse8 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse8) (= .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse8 .cse9))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse9))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse10)))) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse14 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (or (forall ((v_prenex_490 (Array Int Int)) (v_prenex_491 (Array Int Int)) (v_prenex_493 (Array Int Int)) (v_prenex_494 (Array Int Int)) (v_prenex_495 (Array Int Int)) (v_prenex_492 Int)) (let ((.cse13 (+ v_prenex_492 4))) (let ((.cse12 (select v_prenex_491 .cse13))) (or (not (= (select (select (store (store .cse11 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_491) .cse12 v_prenex_490) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_493) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_494) .cse12 v_prenex_495) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_prenex_494 .cse13) 0)) (= .cse12 |c_ULTIMATE.start_main_~p~0#1.base|))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse11 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse14 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse14)))) .cse15) .cse16) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse19 (+ 4 v_subst_2))) (let ((.cse18 (select v_arrayElimArr_19 .cse19)) (.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (or (not (= (select (select (store (store .cse17 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse18 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select v_arrayElimArr_20 .cse19) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse18 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse18) (= .cse18 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) (select v_arrayElimArr_21 (+ 4 v_subst_3)) v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) .cse16) (or (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_prenex_318 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse23 (+ v_prenex_318 4))) (let ((.cse21 (select v_arrayElimArr_21 (+ 4 v_subst_3))) (.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse20 (select v_prenex_317 .cse23))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_320) .cse20 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse21 .cse20) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse21) (= (select (select (store (store .cse22 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse21 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse20) (not (= (select (select (store (store .cse22 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_317) .cse20 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse20) (not (= (select v_prenex_320 .cse23) 0)))))) .cse16) (or (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_prenex_318 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse27 (+ v_prenex_318 4))) (let ((.cse25 (select v_arrayElimArr_21 (+ 4 v_subst_3))) (.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse24 (select v_prenex_317 .cse27))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_320) .cse24 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse25 .cse24) (= (select (select (store (store .cse26 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse25 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse24) (not (= (select (select (store (store .cse26 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_317) .cse24 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse24) (not (= (select v_prenex_320 .cse27) 0)))))) .cse16) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse29 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse31 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse28 (+ 4 v_subst_1))) (let ((.cse30 (select v_arrayElimArr_22 .cse28))) (or (not (= (select v_arrayElimArr_23 .cse28) 0)) (not (= (select (select (store (store .cse29 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse30 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse30 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse30) (= .cse30 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse30 .cse31))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse29 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse31 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse35 (+ 4 v_subst_2))) (let ((.cse33 (select v_arrayElimArr_19 .cse35)) (.cse34 (select (select (store (store .cse32 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) (select v_arrayElimArr_21 (+ 4 v_subst_3)) v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select (select (store (store .cse32 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse33 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse34) (not (= (select v_arrayElimArr_20 .cse35) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse33 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse33) (= .cse33 .cse34))))) .cse16) (or .cse16 (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse40 (+ 4 v_subst_2)) (.cse36 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse39 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse38 (select (select (store (store .cse36 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse39 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse37 (select v_arrayElimArr_19 .cse40))) (or (not (= (select (select (store (store .cse36 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse37 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse38) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse39) (= .cse39 .cse37) (= .cse39 .cse38) (not (= (select v_arrayElimArr_20 .cse40) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse37 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse37)))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse42 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse45 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse44 (select (select (store (store .cse42 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse45 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_23 (Array Int Int)) (v_subst_1 Int)) (let ((.cse41 (+ 4 v_subst_1))) (or (not (= (select v_arrayElimArr_23 .cse41) 0)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse43 (select v_arrayElimArr_22 .cse41))) (or (not (= (select (select (store (store .cse42 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse43 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse43 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse43) (= .cse43 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse43 .cse44) (= .cse43 .cse45))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse44))))) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse46 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse46) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse49 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (or (forall ((v_prenex_466 Int) (v_prenex_464 (Array Int Int)) (v_prenex_465 (Array Int Int)) (v_prenex_467 (Array Int Int)) (v_prenex_468 (Array Int Int)) (v_prenex_469 (Array Int Int))) (let ((.cse47 (+ v_prenex_466 4))) (let ((.cse48 (select v_prenex_465 .cse47))) (or (not (= (select v_prenex_468 .cse47) 0)) (= .cse48 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_467) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_468) .cse48 v_prenex_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select (select (store (store .cse49 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_465) .cse48 v_prenex_464) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse49 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse46 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) .cse15) .cse16) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse54 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse50 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse53 (select (select (store (store .cse50 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse54 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_490 (Array Int Int)) (v_prenex_491 (Array Int Int)) (v_prenex_493 (Array Int Int)) (v_prenex_494 (Array Int Int)) (v_prenex_495 (Array Int Int)) (v_prenex_492 Int)) (let ((.cse52 (+ v_prenex_492 4))) (let ((.cse51 (select v_prenex_491 .cse52))) (or (not (= (select (select (store (store .cse50 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_491) .cse51 v_prenex_490) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_493) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_494) .cse51 v_prenex_495) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_prenex_494 .cse52) 0)) (= .cse51 |c_ULTIMATE.start_main_~p~0#1.base|))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse53) (= .cse54 .cse53))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse54)))) .cse55) .cse16) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse60 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse57 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse59 (select (select (store (store .cse57 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse60 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_23 (Array Int Int)) (v_subst_1 Int)) (let ((.cse56 (+ 4 v_subst_1))) (or (not (= (select v_arrayElimArr_23 .cse56) 0)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse58 (select v_arrayElimArr_22 .cse56))) (or (not (= (select (select (store (store .cse57 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse58 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse58 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse58) (= .cse58 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse58 .cse59))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse59) (= .cse60 .cse59))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse60)))) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int)) (v_subst_1 Int)) (let ((.cse63 (+ 4 v_subst_1))) (let ((.cse61 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse62 (select v_arrayElimArr_22 .cse63)) (.cse64 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((v_prenex_126 (Array Int Int))) (not (= (select (select (store (store .cse61 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse62 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse63) 0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse62 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse62) (= .cse62 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse62 (select (select (store (store .cse61 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse64 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse62 .cse64))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse65 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse65) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse68 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse66 (select (select (store (store .cse68 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse65 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse66) (= .cse65 .cse66) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse67 (+ 4 v_subst_1))) (let ((.cse69 (select v_arrayElimArr_22 .cse67))) (or (not (= (select v_arrayElimArr_23 .cse67) 0)) (not (= (select (select (store (store .cse68 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse69 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse69 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse69) (= .cse69 |c_ULTIMATE.start_main_~a~0#1.base|)))))))))))) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse70 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse70) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse71 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse74 (select (select (store (store .cse71 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse70 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse73 (+ 4 v_subst_2))) (let ((.cse72 (select v_arrayElimArr_19 .cse73))) (or (not (= (select (select (store (store .cse71 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse72 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select v_arrayElimArr_20 .cse73) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse72 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse72) (= .cse72 .cse74))))) (= .cse70 .cse74)))))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse75 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse78 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse76 (select (select (store (store .cse78 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse75 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse75 .cse76) (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (v_prenex_318 Int)) (let ((.cse79 (+ v_prenex_318 4))) (let ((.cse77 (select v_prenex_317 .cse79))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_320) .cse77 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse75 .cse77) (= .cse76 .cse77) (not (= (select (select (store (store .cse78 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_317) .cse77 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse77) (not (= (select v_prenex_320 .cse79) 0)))))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse75))))) .cse16) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse84 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse80 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse83 (select (select (store (store .cse80 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse84 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse82 (+ 4 v_subst_2))) (let ((.cse81 (select v_arrayElimArr_19 .cse82))) (or (not (= (select (select (store (store .cse80 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse81 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select v_arrayElimArr_20 .cse82) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse81 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse81) (= .cse81 .cse83))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse83) (= .cse84 .cse83))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse84)))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse85 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse85) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse88 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse86 (select (select (store (store .cse88 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse85 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse86) (= .cse85 .cse86) (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (v_prenex_318 Int)) (let ((.cse89 (+ v_prenex_318 4))) (let ((.cse87 (select v_prenex_317 .cse89))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_320) .cse87 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse85 .cse87) (= .cse86 .cse87) (not (= (select (select (store (store .cse88 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_317) .cse87 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse87) (not (= (select v_prenex_320 .cse89) 0)))))))))))))) .cse16) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_981 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse92 (+ 4 v_subst_2))) (let ((.cse90 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse91 (select v_arrayElimArr_19 .cse92))) (or (not (= (select (select (store (store .cse90 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse91 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse90 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) (select v_arrayElimArr_21 (+ 4 v_subst_3)) v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_arrayElimArr_20 .cse92) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse91 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse91))))) .cse16) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse97 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse95 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse96 (select (select (store (store .cse95 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse97 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_466 Int) (v_prenex_464 (Array Int Int)) (v_prenex_465 (Array Int Int)) (v_prenex_467 (Array Int Int)) (v_prenex_468 (Array Int Int)) (v_prenex_469 (Array Int Int))) (let ((.cse93 (+ v_prenex_466 4))) (let ((.cse94 (select v_prenex_465 .cse93))) (or (not (= (select v_prenex_468 .cse93) 0)) (= .cse94 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_467) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_468) .cse94 v_prenex_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select (select (store (store .cse95 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_465) .cse94 v_prenex_464) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse96) (= .cse97 .cse96))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse97)))) .cse55) .cse16) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse99 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse102 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse98 (select (select (store (store .cse99 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse102 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse98) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_subst_1 Int)) (let ((.cse101 (+ 4 v_subst_1))) (let ((.cse100 (select v_arrayElimArr_22 .cse101))) (or (forall ((v_prenex_126 (Array Int Int))) (not (= (select (select (store (store .cse99 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse100 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse101) 0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse100 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse100) (= .cse100 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse100 .cse98) (= .cse100 .cse102))))))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse105 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse107 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse103 (select (select (store (store .cse105 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse107 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse103) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse104 (+ 4 v_subst_1))) (let ((.cse106 (select v_arrayElimArr_22 .cse104))) (or (not (= (select v_arrayElimArr_23 .cse104) 0)) (not (= (select (select (store (store .cse105 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse106 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse106 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse106) (= .cse106 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse106 .cse103) (= .cse106 .cse107))))))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse112 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse109 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse111 (select (select (store (store .cse109 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse112 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_23 (Array Int Int)) (v_subst_1 Int)) (let ((.cse108 (+ 4 v_subst_1))) (or (not (= (select v_arrayElimArr_23 .cse108) 0)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse110 (select v_arrayElimArr_22 .cse108))) (or (not (= (select (select (store (store .cse109 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse110 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse110 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse110) (= .cse110 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse110 .cse111))))))) (= .cse112 .cse111))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse112)))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int)) (v_subst_1 Int)) (let ((.cse113 (+ 4 v_subst_1))) (or (not (= (select v_arrayElimArr_23 .cse113) 0)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse114 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse115 (select v_arrayElimArr_22 .cse113)) (.cse116 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (not (= (select (select (store (store .cse114 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse115 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse115 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse115) (= .cse115 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse115 (select (select (store (store .cse114 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse116 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse115 .cse116))))))) (or .cse16 (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse117 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse119 (select v_arrayElimArr_21 (+ 4 v_subst_3))) (.cse121 (+ 4 v_subst_2))) (let ((.cse118 (select v_arrayElimArr_19 .cse121)) (.cse120 (select (select (store (store .cse117 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse119 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select (select (store (store .cse117 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse118 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse119) (= .cse119 .cse120) (not (= (select v_arrayElimArr_20 .cse121) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse118 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse118) (= .cse118 .cse120)))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse123 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse122 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse123 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse122) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse123) (= .cse123 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse122))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse124 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse124) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse126 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse128 (select (select (store (store .cse126 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse124 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse125 (+ 4 v_subst_1))) (let ((.cse127 (select v_arrayElimArr_22 .cse125))) (or (not (= (select v_arrayElimArr_23 .cse125) 0)) (not (= (select (select (store (store .cse126 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse127 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse127 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse127) (= .cse127 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse127 .cse128))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse128)))))))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse133 (+ 4 v_subst_2)) (.cse129 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse132 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse131 (select (select (store (store .cse129 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse132 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse130 (select v_arrayElimArr_19 .cse133))) (or (not (= (select (select (store (store .cse129 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse130 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse131) (= .cse132 .cse130) (= .cse132 .cse131) (not (= (select v_arrayElimArr_20 .cse133) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse130 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse130))))) .cse16) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse137 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse134 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse136 (+ 4 v_subst_2))) (let ((.cse135 (select v_arrayElimArr_19 .cse136))) (or (not (= (select (select (store (store .cse134 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse135 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select v_arrayElimArr_20 .cse136) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse135 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse135))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse134 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse137 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse137)))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse142 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse138 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse140 (select (select (store (store .cse138 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse142 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse141 (+ 4 v_subst_2))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse139 (select v_arrayElimArr_19 .cse141))) (or (not (= (select (select (store (store .cse138 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse139 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse139 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse139) (= .cse139 .cse140)))) (not (= (select v_arrayElimArr_20 .cse141) 0))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse140))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse142))))) .cse16) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse144 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse147 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse146 (select (select (store (store .cse144 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse147 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse143 (+ 4 v_subst_1))) (let ((.cse145 (select v_arrayElimArr_22 .cse143))) (or (not (= (select v_arrayElimArr_23 .cse143) 0)) (not (= (select (select (store (store .cse144 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse145 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse145 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse145) (= .cse145 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse145 .cse146))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse147) (= .cse147 .cse146))))) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse148 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse148) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse149 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse152 (select (select (store (store .cse149 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse148 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse151 (+ 4 v_subst_2))) (let ((.cse150 (select v_arrayElimArr_19 .cse151))) (or (not (= (select (select (store (store .cse149 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse150 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select v_arrayElimArr_20 .cse151) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse150 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse150) (= .cse150 .cse152))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse152)))))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse153 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse153) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse156 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse154 (select (select (store (store .cse156 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse153 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse154) (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (v_prenex_318 Int)) (let ((.cse157 (+ v_prenex_318 4))) (let ((.cse155 (select v_prenex_317 .cse157))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_320) .cse155 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse153 .cse155) (= .cse154 .cse155) (not (= (select (select (store (store .cse156 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_317) .cse155 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse155) (not (= (select v_prenex_320 .cse157) 0)))))))))))))) .cse16) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse162 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse159 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse161 (select (select (store (store .cse159 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse162 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse158 (+ 4 v_subst_1))) (let ((.cse160 (select v_arrayElimArr_22 .cse158))) (or (not (= (select v_arrayElimArr_23 .cse158) 0)) (not (= (select (select (store (store .cse159 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse160 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse160 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse160) (= .cse160 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse160 .cse161))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse161) (= .cse162 .cse161))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse162)))) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse163 (+ 4 v_subst_1))) (let ((.cse164 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse165 (select v_arrayElimArr_22 .cse163)) (.cse166 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (not (= (select v_arrayElimArr_23 .cse163) 0)) (not (= (select (select (store (store .cse164 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse165 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse165 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse165) (= .cse165 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse165 (select (select (store (store .cse164 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse166 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse165 .cse166))))) (or (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_prenex_318 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse171 (+ v_prenex_318 4)) (.cse170 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse168 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse169 (select (select (store (store .cse170 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse168 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse167 (select v_prenex_317 .cse171))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_320) .cse167 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse168 .cse167) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse169) (= .cse169 .cse167) (not (= (select (select (store (store .cse170 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_317) .cse167 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse167) (not (= (select v_prenex_320 .cse171) 0)))))) .cse16) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse176 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse172 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse174 (select (select (store (store .cse172 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse176 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse175 (+ 4 v_subst_2))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse173 (select v_arrayElimArr_19 .cse175))) (or (not (= (select (select (store (store .cse172 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse173 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse173 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse173) (= .cse173 .cse174)))) (not (= (select v_arrayElimArr_20 .cse175) 0))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse174) (= .cse176 .cse174))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse176)))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse181 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse177 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse180 (select (select (store (store .cse177 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse181 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse179 (+ 4 v_subst_2))) (let ((.cse178 (select v_arrayElimArr_19 .cse179))) (or (not (= (select (select (store (store .cse177 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse178 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select v_arrayElimArr_20 .cse179) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse178 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse178))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse180) (= .cse181 .cse180))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse181))))) .cse16))))) is different from true [2022-12-14 14:43:09,782 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|))) (let ((.cse64 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse187 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse190 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse186 (select (select (store (store .cse190 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse187 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse186) (= .cse186 .cse187) (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse189 (+ 4 v_subst_2))) (let ((.cse188 (select v_arrayElimArr_19 .cse189))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse188 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse187 .cse188) (not (= (select v_arrayElimArr_20 .cse189) 0)) (not (= (select (select (store (store .cse190 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse188 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse188))))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse187))))))) (.cse70 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse182 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse182) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse183 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse183 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse182 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse185 (+ 4 v_subst_2))) (let ((.cse184 (select v_arrayElimArr_19 .cse185))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse184 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse182 .cse184) (not (= (select v_arrayElimArr_20 .cse185) 0)) (not (= (select (select (store (store .cse183 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse184 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse184))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0))))) (.cse7 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse0 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse0) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse5 (select (select (store (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse0 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse1 (+ 4 v_subst_1))) (let ((.cse2 (select v_arrayElimArr_22 .cse1))) (or (not (= (select v_arrayElimArr_23 .cse1) 0)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse2) (= .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse2 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse2 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse5) (= .cse5 .cse0)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (or .cse7 (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (|v_ULTIMATE.start_main_~t~0#1.base_41| Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse10 (+ 4 v_subst_2)) (.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse9 (select (select (store (store .cse11 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) (select v_arrayElimArr_21 (+ 4 v_subst_3)) v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse8 (select v_arrayElimArr_19 .cse10))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse8 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse9) (= .cse9 .cse8) (not (= (select v_arrayElimArr_20 .cse10) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (not (= (select (select (store (store .cse11 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse8 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse8)))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int)) (v_subst_1 Int)) (let ((.cse15 (+ 4 v_subst_1))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse14 (select v_arrayElimArr_21 (+ 4 v_subst_3))) (.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse12 (select v_arrayElimArr_22 .cse15))) (or (= .cse12 (select (select (store (store .cse13 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse14 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse12) (= .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse12 .cse14) (not (= (select (select (store (store .cse13 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse12 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse12 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select v_arrayElimArr_23 .cse15) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse16 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse16) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse17 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse16 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse19 (+ 4 v_subst_2))) (let ((.cse18 (select v_arrayElimArr_19 .cse19))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse18 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_20 .cse19) 0)) (not (= (select (select (store (store .cse17 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse18 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse18))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse24 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse22 (select (select (store (store .cse23 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse24 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (forall ((v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse20 (+ 4 v_subst_2))) (or (not (= (select v_arrayElimArr_20 .cse20) 0)) (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse21 (select v_arrayElimArr_19 .cse20))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse21 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse22 .cse21) (not (= (select (select (store (store .cse23 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse21 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse21))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse22))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse24)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0))))) .cse7) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse29 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse28 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse25 (select (select (store (store .cse29 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse28 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse25) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse26 (+ 4 v_subst_1))) (let ((.cse27 (select v_arrayElimArr_22 .cse26))) (or (not (= (select v_arrayElimArr_23 .cse26) 0)) (= .cse27 .cse25) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse27) (= .cse27 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse27 .cse28) (not (= (select (select (store (store .cse29 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse27 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse27 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse31 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse34 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse30 (select (select (store (store .cse34 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse31 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse30 .cse31) (forall ((v_arrayElimArr_23 (Array Int Int)) (v_subst_1 Int)) (let ((.cse32 (+ 4 v_subst_1))) (or (not (= (select v_arrayElimArr_23 .cse32) 0)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse33 (select v_arrayElimArr_22 .cse32))) (or (= .cse33 .cse30) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse33) (= .cse33 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store .cse34 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse33 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse33 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|))))))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse31)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int)) (v_subst_1 Int)) (let ((.cse35 (+ 4 v_subst_1))) (let ((.cse37 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse36 (select v_arrayElimArr_22 .cse35)) (.cse38 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse35) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse36 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= .cse36 (select (select (store (store .cse37 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse38 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (forall ((v_prenex_126 (Array Int Int))) (not (= (select (select (store (store .cse37 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse36 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse36) (= .cse36 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse36 .cse38))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (or .cse7 (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse39 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse42 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse41 (select (select (store (store .cse42 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse39 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (v_prenex_318 Int)) (let ((.cse43 (+ v_prenex_318 4))) (let ((.cse40 (select v_prenex_317 .cse43))) (or (= .cse39 .cse40) (= .cse41 .cse40) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_320) .cse40 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store .cse42 |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_317) .cse40 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse40) (not (= (select v_prenex_320 .cse43) 0)))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse41))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse39)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse48 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse47 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse45 (select (select (store (store .cse47 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse48 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse46 (+ 4 v_subst_2))) (let ((.cse44 (select v_arrayElimArr_19 .cse46))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse44 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse45 .cse44) (not (= (select v_arrayElimArr_20 .cse46) 0)) (not (= (select (select (store (store .cse47 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse44 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse44))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse45))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse48)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))))) (or (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_prenex_318 Int) (|v_ULTIMATE.start_main_~t~0#1.base_41| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse53 (+ v_prenex_318 4)) (.cse52 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse49 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse51 (select (select (store (store .cse52 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse49 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse50 (select v_prenex_317 .cse53))) (or (= .cse49 .cse50) (= .cse51 .cse50) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_320) .cse50 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse51) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store .cse52 |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_317) .cse50 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse50) (not (= (select v_prenex_320 .cse53) 0)))))) .cse7) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_3 Int) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_2 Int) (|v_ULTIMATE.start_main_~t~0#1.base_41| Int) (v_ArrVal_981 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse57 (+ 4 v_subst_2)) (.cse58 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse56 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse55 (select (select (store (store .cse58 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse56 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse54 (select v_arrayElimArr_19 .cse57))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse54 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse55) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse56) (= .cse56 .cse54) (= .cse55 .cse56) (not (= (select v_arrayElimArr_20 .cse57) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (not (= (select (select (store (store .cse58 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse54 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse54))))) .cse7) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (|v_ULTIMATE.start_main_~t~0#1.base_41| Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse62 (+ 4 v_subst_2)) (.cse63 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse61 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse60 (select (select (store (store .cse63 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse61 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse59 (select v_arrayElimArr_19 .cse62))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse59 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse60 .cse59) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse61) (= .cse60 .cse61) (not (= (select v_arrayElimArr_20 .cse62) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (not (= (select (select (store (store .cse63 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse59 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse59))))) .cse7) (or (and .cse64 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse69 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse68 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse65 (select (select (store (store .cse68 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse69 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse65) (forall ((v_prenex_466 Int) (v_prenex_464 (Array Int Int)) (v_prenex_465 (Array Int Int)) (v_prenex_467 (Array Int Int)) (v_prenex_468 (Array Int Int)) (v_prenex_469 (Array Int Int))) (let ((.cse67 (+ v_prenex_466 4))) (let ((.cse66 (select v_prenex_465 .cse67))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_467) |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_468) .cse66 v_prenex_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_prenex_468 .cse67) 0)) (not (= (select (select (store (store .cse68 |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_465) .cse66 v_prenex_464) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse66 |c_ULTIMATE.start_main_~p~0#1.base|))))) (= .cse65 .cse69))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse69)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0))))) .cse7) (or (and .cse70 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse71 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse71) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse72 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse72 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse71 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (forall ((v_prenex_490 (Array Int Int)) (v_prenex_491 (Array Int Int)) (v_prenex_493 (Array Int Int)) (v_prenex_494 (Array Int Int)) (v_prenex_495 (Array Int Int)) (v_prenex_492 Int)) (let ((.cse74 (+ v_prenex_492 4))) (let ((.cse73 (select v_prenex_491 .cse74))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_493) |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_494) .cse73 v_prenex_495) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_prenex_494 .cse74) 0)) (not (= (select (select (store (store .cse72 |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_491) .cse73 v_prenex_490) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse73 |c_ULTIMATE.start_main_~p~0#1.base|))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0))))) .cse7) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse76 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse79 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse75 (select (select (store (store .cse79 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse76 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse75) (= .cse75 .cse76) (forall ((v_arrayElimArr_23 (Array Int Int)) (v_subst_1 Int)) (let ((.cse77 (+ 4 v_subst_1))) (or (not (= (select v_arrayElimArr_23 .cse77) 0)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse78 (select v_arrayElimArr_22 .cse77))) (or (= .cse78 .cse75) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse78) (= .cse78 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store .cse79 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse78 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse78 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|))))))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse76)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse80 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse80) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse84 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse83 (select (select (store (store .cse84 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse80 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse81 (+ 4 v_subst_1))) (let ((.cse82 (select v_arrayElimArr_22 .cse81))) (or (not (= (select v_arrayElimArr_23 .cse81) 0)) (= .cse82 .cse83) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse82) (= .cse82 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store .cse84 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse82 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse82 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse83) (= .cse83 .cse80)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (or .cse7 (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (|v_ULTIMATE.start_main_~t~0#1.base_41| Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse87 (+ 4 v_subst_2))) (let ((.cse86 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse85 (select v_arrayElimArr_19 .cse87))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse85 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse86 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) (select v_arrayElimArr_21 (+ 4 v_subst_3)) v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_20 .cse87) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (not (= (select (select (store (store .cse86 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse85 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse85)))))) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse92 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse91 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse88 (select (select (store (store .cse91 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse92 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse88) (forall ((v_prenex_490 (Array Int Int)) (v_prenex_491 (Array Int Int)) (v_prenex_493 (Array Int Int)) (v_prenex_494 (Array Int Int)) (v_prenex_495 (Array Int Int)) (v_prenex_492 Int)) (let ((.cse90 (+ v_prenex_492 4))) (let ((.cse89 (select v_prenex_491 .cse90))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_493) |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_494) .cse89 v_prenex_495) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_prenex_494 .cse90) 0)) (not (= (select (select (store (store .cse91 |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_491) .cse89 v_prenex_490) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse89 |c_ULTIMATE.start_main_~p~0#1.base|))))) (= .cse88 .cse92))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse92)))))) .cse64) .cse7) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse93 (+ 4 v_subst_1))) (let ((.cse96 (select v_arrayElimArr_21 (+ 4 v_subst_3))) (.cse95 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse94 (select v_arrayElimArr_22 .cse93))) (or (not (= (select v_arrayElimArr_23 .cse93) 0)) (= .cse94 (select (select (store (store .cse95 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse96 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse94) (= .cse94 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse94 .cse96) (not (= (select (select (store (store .cse95 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse94 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse94 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse101 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse100 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse97 (select (select (store (store .cse100 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse101 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse97) (forall ((v_arrayElimArr_23 (Array Int Int)) (v_subst_1 Int)) (let ((.cse98 (+ 4 v_subst_1))) (or (not (= (select v_arrayElimArr_23 .cse98) 0)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse99 (select v_arrayElimArr_22 .cse98))) (or (= .cse99 .cse97) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse99) (= .cse99 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store .cse100 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse99 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse99 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|))))))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse101)))))) (or .cse7 (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse103 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse106 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse102 (select (select (store (store .cse106 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse103 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse102) (= .cse102 .cse103) (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse105 (+ 4 v_subst_2))) (let ((.cse104 (select v_arrayElimArr_19 .cse105))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse104 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_20 .cse105) 0)) (not (= (select (select (store (store .cse106 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse104 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse104))))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse103)))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse107 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse107) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse111 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse110 (select (select (store (store .cse111 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse107 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (forall ((v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse108 (+ 4 v_subst_2))) (or (not (= (select v_arrayElimArr_20 .cse108) 0)) (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse109 (select v_arrayElimArr_19 .cse108))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse109 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse110 .cse109) (not (= (select (select (store (store .cse111 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse109 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse109))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse110) (= .cse110 .cse107)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))))) (or .cse7 (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_3 Int) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_2 Int) (|v_ULTIMATE.start_main_~t~0#1.base_41| Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse115 (+ 4 v_subst_2)) (.cse116 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse114 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse113 (select (select (store (store .cse116 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse114 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse112 (select v_arrayElimArr_19 .cse115))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse112 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse113) (= .cse114 .cse112) (= .cse113 .cse114) (not (= (select v_arrayElimArr_20 .cse115) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (not (= (select (select (store (store .cse116 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse112 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse112)))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse118 (select v_arrayElimArr_21 (+ 4 v_subst_3))) (.cse117 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse117 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse118 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse119 (+ 4 v_subst_1))) (let ((.cse120 (select v_arrayElimArr_22 .cse119))) (or (not (= (select v_arrayElimArr_23 .cse119) 0)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse120) (= .cse120 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse120 .cse118) (not (= (select (select (store (store .cse117 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse120 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse120 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (or (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_prenex_318 Int) (|v_ULTIMATE.start_main_~t~0#1.base_41| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse124 (+ v_prenex_318 4))) (let ((.cse121 (select v_arrayElimArr_21 (+ 4 v_subst_3))) (.cse123 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse122 (select v_prenex_317 .cse124))) (or (= .cse121 .cse122) (= (select (select (store (store .cse123 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse121 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse122) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_320) .cse122 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse121) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store .cse123 |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_317) .cse122 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse122) (not (= (select v_prenex_320 .cse124) 0)))))) .cse7) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse126 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse125 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse126 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse125) (= .cse125 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse126) (= .cse126 |c_ULTIMATE.start_main_~a~0#1.base|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse130 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse131 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse127 (select (select (store (store .cse130 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse131 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse127) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_subst_1 Int)) (let ((.cse128 (+ 4 v_subst_1))) (let ((.cse129 (select v_arrayElimArr_22 .cse128))) (or (forall ((v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse128) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse129 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= .cse129 .cse127) (forall ((v_prenex_126 (Array Int Int))) (not (= (select (select (store (store .cse130 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse129 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse129) (= .cse129 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse129 .cse131))))))))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse135 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse134 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse133 (select (select (store (store .cse135 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse134 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (forall ((v_arrayElimArr_23 (Array Int Int)) (v_subst_1 Int)) (let ((.cse136 (+ 4 v_subst_1))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse132 (select v_arrayElimArr_22 .cse136))) (or (= .cse132 .cse133) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse132) (= .cse132 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse132 .cse134) (not (= (select (select (store (store .cse135 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse132 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse132 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select v_arrayElimArr_23 .cse136) 0))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse133))))))) (or (and .cse70 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse138 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse137 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse137 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse138 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (forall ((v_prenex_466 Int) (v_prenex_464 (Array Int Int)) (v_prenex_465 (Array Int Int)) (v_prenex_467 (Array Int Int)) (v_prenex_468 (Array Int Int)) (v_prenex_469 (Array Int Int))) (let ((.cse140 (+ v_prenex_466 4))) (let ((.cse139 (select v_prenex_465 .cse140))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_467) |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_468) .cse139 v_prenex_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_prenex_468 .cse140) 0)) (not (= (select (select (store (store .cse137 |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_465) .cse139 v_prenex_464) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse139 |c_ULTIMATE.start_main_~p~0#1.base|)))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse138)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0))))) .cse7) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse141 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse141) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse144 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse143 (select (select (store (store .cse144 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse141 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (v_prenex_318 Int)) (let ((.cse145 (+ v_prenex_318 4))) (let ((.cse142 (select v_prenex_317 .cse145))) (or (= .cse141 .cse142) (= .cse143 .cse142) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_320) .cse142 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store .cse144 |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_317) .cse142 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse142) (not (= (select v_prenex_320 .cse145) 0)))))) (= .cse143 .cse141)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse146 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse146) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse150 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse148 (select (select (store (store .cse150 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse146 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse149 (+ 4 v_subst_2))) (let ((.cse147 (select v_arrayElimArr_19 .cse149))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse147 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse148 .cse147) (not (= (select v_arrayElimArr_20 .cse149) 0)) (not (= (select (select (store (store .cse150 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse147 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse147))))) (= .cse148 .cse146))))))))))) .cse7) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse154 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse155 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse153 (select (select (store (store .cse154 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse155 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse151 (+ 4 v_subst_1))) (let ((.cse152 (select v_arrayElimArr_22 .cse151))) (or (not (= (select v_arrayElimArr_23 .cse151) 0)) (= .cse152 .cse153) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse152) (= .cse152 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store .cse154 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse152 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse152 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse155) (= .cse153 .cse155))))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse156 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse156) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse160 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse159 (select (select (store (store .cse160 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse156 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse157 (+ 4 v_subst_1))) (let ((.cse158 (select v_arrayElimArr_22 .cse157))) (or (not (= (select v_arrayElimArr_23 .cse157) 0)) (= .cse158 .cse159) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse158) (= .cse158 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store .cse160 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse158 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse158 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse159)))))))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse161 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse161) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse164 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse162 (+ 4 v_subst_1))) (let ((.cse163 (select v_arrayElimArr_22 .cse162))) (or (not (= (select v_arrayElimArr_23 .cse162) 0)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse163) (= .cse163 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store .cse164 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse163 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse163 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse164 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse161 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))))))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (|v_ULTIMATE.start_main_~t~0#1.base_41| Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse167 (+ 4 v_subst_2))) (let ((.cse166 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse165 (select v_arrayElimArr_19 .cse167))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse165 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (= (select (select (store (store .cse166 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) (select v_arrayElimArr_21 (+ 4 v_subst_3)) v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse165) (not (= (select v_arrayElimArr_20 .cse167) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (not (= (select (select (store (store .cse166 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse165 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse165))))) .cse7) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse168 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse171 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse170 (select (select (store (store .cse171 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse168 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (v_prenex_318 Int)) (let ((.cse172 (+ v_prenex_318 4))) (let ((.cse169 (select v_prenex_317 .cse172))) (or (= .cse168 .cse169) (= .cse170 .cse169) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_320) .cse169 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store .cse171 |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_317) .cse169 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse169) (not (= (select v_prenex_320 .cse172) 0)))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse170) (= .cse170 .cse168))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse168)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse173 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse173) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse177 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse175 (select (select (store (store .cse177 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse173 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse176 (+ 4 v_subst_2))) (let ((.cse174 (select v_arrayElimArr_19 .cse176))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse174 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse175 .cse174) (not (= (select v_arrayElimArr_20 .cse176) 0)) (not (= (select (select (store (store .cse177 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse174 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse174))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse175) (= .cse175 .cse173)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0))))) .cse7) (or (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_prenex_318 Int) (|v_ULTIMATE.start_main_~t~0#1.base_41| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse181 (+ v_prenex_318 4))) (let ((.cse178 (select v_arrayElimArr_21 (+ 4 v_subst_3))) (.cse180 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse179 (select v_prenex_317 .cse181))) (or (= .cse178 .cse179) (= (select (select (store (store .cse180 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse178 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse179) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_320) .cse179 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store .cse180 |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_317) .cse179 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse179) (not (= (select v_prenex_320 .cse181) 0)))))) .cse7)))) (< |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from true [2022-12-14 14:43:10,679 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:10,679 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 54 [2022-12-14 14:43:10,726 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:10,726 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 54 [2022-12-14 14:43:10,766 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:10,766 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 58 [2022-12-14 14:43:10,812 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:10,812 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 106 [2022-12-14 14:43:10,863 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:10,863 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 58 [2022-12-14 14:43:10,907 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:10,907 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 54 [2022-12-14 14:43:10,954 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:10,954 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 54 [2022-12-14 14:43:10,998 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:10,998 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 80 [2022-12-14 14:43:11,038 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:11,038 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 80 [2022-12-14 14:43:11,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:11,086 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 80 [2022-12-14 14:43:11,132 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:11,132 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 80 [2022-12-14 14:43:11,176 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:11,177 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 80 [2022-12-14 14:43:11,226 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:11,227 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 80 [2022-12-14 14:43:11,271 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:11,271 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 80 [2022-12-14 14:43:11,321 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:11,321 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 58 [2022-12-14 14:43:11,371 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:11,371 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 106 [2022-12-14 14:43:11,419 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:11,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 84 [2022-12-14 14:43:11,460 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:11,460 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 84 [2022-12-14 14:43:11,509 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:11,509 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 58 [2022-12-14 14:43:11,549 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:11,549 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 80 [2022-12-14 14:43:11,588 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:11,588 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 84 [2022-12-14 14:43:11,633 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:11,633 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 80 [2022-12-14 14:43:11,682 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:11,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 54 [2022-12-14 14:43:11,724 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:11,725 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 54 [2022-12-14 14:43:11,765 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:11,765 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 54 [2022-12-14 14:43:11,801 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:11,802 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 80 [2022-12-14 14:43:11,846 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:11,846 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 53 [2022-12-14 14:43:11,870 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:11,870 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 58 [2022-12-14 14:43:11,910 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:11,910 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 80 [2022-12-14 14:43:11,960 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:11,960 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 80 [2022-12-14 14:43:12,005 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:12,006 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 80 [2022-12-14 14:43:12,050 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:12,050 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 84 [2022-12-14 14:43:12,096 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:12,097 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 80 [2022-12-14 14:43:12,137 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:12,138 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 80 [2022-12-14 14:43:12,182 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:12,183 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 80 [2022-12-14 14:43:12,226 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:12,226 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 84 [2022-12-14 14:43:12,269 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:12,269 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 54 [2022-12-14 14:43:12,314 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:12,314 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 80 [2022-12-14 14:43:12,361 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:12,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 106 [2022-12-14 14:43:12,412 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:12,413 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 58 [2022-12-14 14:43:12,464 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:12,464 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 106 [2022-12-14 14:43:12,511 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:12,511 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 106 [2022-12-14 14:43:12,563 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:12,563 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 80 [2022-12-14 14:46:32,442 WARN L233 SmtUtils]: Spent 3.26m on a formula simplification that was a NOOP. DAG size: 1173 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:51:19,964 WARN L233 SmtUtils]: Spent 4.54m on a formula simplification. DAG size of input: 1261 DAG size of output: 121 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:51:20,005 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:51:20,005 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 436 treesize of output 427 [2022-12-14 14:51:20,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:51:20,019 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 416 treesize of output 357 [2022-12-14 14:51:20,053 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:51:20,054 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 3494 treesize of output 3391 [2022-12-14 14:51:20,124 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:51:20,124 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 3862 treesize of output 3849 [2022-12-14 14:51:20,172 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 3833 treesize of output 3801 [2022-12-14 14:51:20,217 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:51:20,217 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 3801 treesize of output 3694 [2022-12-14 14:51:20,266 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:51:20,266 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 3685 treesize of output 3502 [2022-12-14 14:51:20,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:51:20,316 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 3493 treesize of output 3490 [2022-12-14 14:51:20,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 3481 treesize of output 3465 [2022-12-14 14:51:20,394 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:51:20,394 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 3465 treesize of output 3270 [2022-12-14 14:51:20,428 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 3261 treesize of output 3197 [2022-12-14 14:51:20,526 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:51:20,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3204 treesize of output 3260 [2022-12-14 14:51:20,594 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 3183 treesize of output 3179 [2022-12-14 14:51:20,653 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:51:20,654 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 3179 treesize of output 3000 [2022-12-14 14:51:20,692 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 2991 treesize of output 2959 [2022-12-14 14:51:20,730 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 2959 treesize of output 2951 [2022-12-14 14:51:20,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:51:20,793 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 2992 treesize of output 2668 [2022-12-14 14:51:20,831 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 2631 treesize of output 2599 [2022-12-14 14:51:20,888 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:51:20,889 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 2599 treesize of output 2548 [2022-12-14 14:51:20,954 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:51:20,954 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 2539 treesize of output 2528 [2022-12-14 14:51:20,994 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 2519 treesize of output 2391 [2022-12-14 14:51:21,034 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 2391 treesize of output 2359 [2022-12-14 14:51:21,095 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:51:21,096 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 2359 treesize of output 2280 [2022-12-14 14:51:21,156 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:51:21,157 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 2308 treesize of output 2264 [2022-12-14 14:51:32,207 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:51:32,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 44 treesize of output 114 [2022-12-14 14:51:33,322 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-14 14:51:33,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838945398] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:51:33,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [852681312] [2022-12-14 14:51:33,323 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-12-14 14:51:33,323 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:51:33,323 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:51:33,323 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:51:33,323 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:51:33,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:33,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:33,346 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 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 14:51:33,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:33,385 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-14 14:51:33,393 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 15 treesize of output 1 [2022-12-14 14:51:33,400 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 15 treesize of output 1 [2022-12-14 14:51:33,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:33,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:33,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:33,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:33,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:33,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 14:51:33,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:33,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:33,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 14:51:33,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:51:33,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:51:33,526 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:51:33,526 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 34 treesize of output 16 [2022-12-14 14:51:33,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:33,539 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 34 treesize of output 16 [2022-12-14 14:51:33,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:33,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:33,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:33,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-12-14 14:51:33,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:33,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:33,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:33,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:33,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:33,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:33,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:33,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:33,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:33,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 54 [2022-12-14 14:51:33,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:51:33,691 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:51:33,691 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 395 treesize of output 344 [2022-12-14 14:51:33,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:33,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:33,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:33,722 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:51:33,723 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:51:33,731 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-12-14 14:51:33,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 341 treesize of output 322 [2022-12-14 14:51:33,755 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:51:33,804 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:51:33,804 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 335 treesize of output 338 [2022-12-14 14:51:34,058 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:51:34,102 INFO L321 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2022-12-14 14:51:34,103 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 3 case distinctions, treesize of input 207 treesize of output 119 [2022-12-14 14:51:34,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:34,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:34,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:34,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:34,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:34,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:34,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-12-14 14:51:34,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:34,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:34,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:34,158 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 61 treesize of output 42 [2022-12-14 14:51:34,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:34,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:34,234 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 14:51:34,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 33 treesize of output 46 [2022-12-14 14:51:34,281 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:51:34,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 16 [2022-12-14 14:51:34,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:34,299 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 34 treesize of output 16 [2022-12-14 14:51:34,318 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 9 [2022-12-14 14:51:34,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:51:34,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:51:34,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:51:34,355 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 19 treesize of output 1 [2022-12-14 14:51:34,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:51:34,423 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:51:34,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 16 [2022-12-14 14:51:34,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:34,440 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 34 treesize of output 16 [2022-12-14 14:51:34,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:51:34,497 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:51:34,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 16 [2022-12-14 14:51:34,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:34,511 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 34 treesize of output 16 [2022-12-14 14:51:34,702 INFO L321 Elim1Store]: treesize reduction 62, result has 41.5 percent of original size [2022-12-14 14:51:34,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 185 treesize of output 217 [2022-12-14 14:51:34,790 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-12-14 14:51:34,791 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 176 treesize of output 190 [2022-12-14 14:51:34,970 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 19 treesize of output 1 [2022-12-14 14:51:34,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:51:34,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:51:35,107 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-12-14 14:51:35,108 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 177 treesize of output 169 [2022-12-14 14:51:35,191 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-12-14 14:51:35,191 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 165 treesize of output 157 [2022-12-14 14:51:35,263 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-12-14 14:51:35,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 149 treesize of output 155 [2022-12-14 14:51:36,201 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 14:51:36,287 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-12-14 14:51:36,287 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 33 [2022-12-14 14:51:36,441 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-12-14 14:51:36,441 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 33 [2022-12-14 14:51:36,604 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-12-14 14:51:36,605 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 188 treesize of output 180 [2022-12-14 14:51:36,688 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-12-14 14:51:36,688 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 176 treesize of output 168 [2022-12-14 14:51:36,767 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-12-14 14:51:36,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 160 treesize of output 166 [2022-12-14 14:51:37,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:51:37,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:51:37,046 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 34 treesize of output 16 [2022-12-14 14:51:37,083 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 14:51:37,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 16 [2022-12-14 14:51:37,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:51:37,125 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 9 [2022-12-14 14:51:37,130 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:51:45,903 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8405#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= |ULTIMATE.start_main_~flag~0#1| 1) (<= 0 |ULTIMATE.start_main_~flag~0#1|) (not (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 14:51:45,904 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:51:45,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:51:45,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 25] total 65 [2022-12-14 14:51:45,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317000706] [2022-12-14 14:51:45,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:51:45,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-12-14 14:51:45,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:51:45,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-12-14 14:51:45,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=625, Invalid=6511, Unknown=12, NotChecked=334, Total=7482 [2022-12-14 14:51:45,907 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 67 states, 66 states have (on average 1.893939393939394) internal successors, (125), 66 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:51:50,271 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (let ((.cse2 (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (= |c_ULTIMATE.start_main_~t~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse11 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (= .cse1 |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse13 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse5 (< |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 1) (= .cse0 1) (not (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|)) (not .cse2) .cse3 .cse4 (or .cse5 (and .cse2 .cse6) (and (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (= (select |c_#valid| .cse7) 1) (= .cse7 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int)) (let ((.cse10 (+ |ULTIMATE.start_main_~p~0#1.offset| 4))) (or (forall ((v_ArrVal_980 (Array Int Int))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse10 |c_ULTIMATE.start_main_~t~0#1.offset|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (forall ((v_ArrVal_981 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 .cse10 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)))))))) .cse11 .cse6 (or (and .cse4 .cse11 (= |c_ULTIMATE.start_main_~flag~0#1| .cse0)) (= |c_ULTIMATE.start_main_~flag~0#1| 0)) (or (exists ((|v_ULTIMATE.start_main_~p~0#1.offset_232| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| .cse1) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_232|)))) (and (= |c_ULTIMATE.start_main_~p~0#1.base| .cse12) (not (= |c_ULTIMATE.start_main_~a~0#1.base| .cse12))))) .cse3) .cse13 (or (let ((.cse75 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse198 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse201 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse197 (select (select (store (store .cse201 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse198 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse197) (= .cse197 .cse198) (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse200 (+ 4 v_subst_2))) (let ((.cse199 (select v_arrayElimArr_19 .cse200))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse199 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse198 .cse199) (not (= (select v_arrayElimArr_20 .cse200) 0)) (not (= (select (select (store (store .cse201 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse199 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse199))))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse198))))))) (.cse81 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse193 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse193) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse194 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse194 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse193 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse196 (+ 4 v_subst_2))) (let ((.cse195 (select v_arrayElimArr_19 .cse196))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse195 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse193 .cse195) (not (= (select v_arrayElimArr_20 .cse196) 0)) (not (= (select (select (store (store .cse194 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse195 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse195))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))))) (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse14 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse14) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse18 (select (select (store (store .cse17 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse14 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse15 (+ 4 v_subst_1))) (let ((.cse16 (select v_arrayElimArr_22 .cse15))) (or (not (= (select v_arrayElimArr_23 .cse15) 0)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse16) (= .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store .cse17 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse16 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse16 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse18) (= .cse18 .cse14)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (or .cse13 (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (|v_ULTIMATE.start_main_~t~0#1.base_41| Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse21 (+ 4 v_subst_2)) (.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse20 (select (select (store (store .cse22 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) (select v_arrayElimArr_21 (+ 4 v_subst_3)) v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (.cse19 (select v_arrayElimArr_19 .cse21))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse19 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse20) (= .cse20 .cse19) (not (= (select v_arrayElimArr_20 .cse21) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (not (= (select (select (store (store .cse22 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse19 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse19)))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int)) (v_subst_1 Int)) (let ((.cse26 (+ 4 v_subst_1))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse25 (select v_arrayElimArr_21 (+ 4 v_subst_3))) (.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse23 (select v_arrayElimArr_22 .cse26))) (or (= .cse23 (select (select (store (store .cse24 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse25 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse23) (= .cse23 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse23 .cse25) (not (= (select (select (store (store .cse24 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse23 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse23 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select v_arrayElimArr_23 .cse26) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse27 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse27) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse28 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse27 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse30 (+ 4 v_subst_2))) (let ((.cse29 (select v_arrayElimArr_19 .cse30))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse29 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_20 .cse30) 0)) (not (= (select (select (store (store .cse28 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse29 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse29))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse35 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse34 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse33 (select (select (store (store .cse34 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse35 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (forall ((v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse31 (+ 4 v_subst_2))) (or (not (= (select v_arrayElimArr_20 .cse31) 0)) (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse32 (select v_arrayElimArr_19 .cse31))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse32 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse33 .cse32) (not (= (select (select (store (store .cse34 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse32 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse32))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse33))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse35)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0))))) .cse13) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse39 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse36 (select (select (store (store .cse40 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse39 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse36) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse37 (+ 4 v_subst_1))) (let ((.cse38 (select v_arrayElimArr_22 .cse37))) (or (not (= (select v_arrayElimArr_23 .cse37) 0)) (= .cse38 .cse36) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse38) (= .cse38 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse38 .cse39) (not (= (select (select (store (store .cse40 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse38 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse38 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse42 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse45 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse41 (select (select (store (store .cse45 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse42 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (= .cse41 .cse42) (forall ((v_arrayElimArr_23 (Array Int Int)) (v_subst_1 Int)) (let ((.cse43 (+ 4 v_subst_1))) (or (not (= (select v_arrayElimArr_23 .cse43) 0)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse44 (select v_arrayElimArr_22 .cse43))) (or (= .cse44 .cse41) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse44) (= .cse44 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store .cse45 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse44 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse44 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|))))))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse42)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int)) (v_subst_1 Int)) (let ((.cse46 (+ 4 v_subst_1))) (let ((.cse48 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse47 (select v_arrayElimArr_22 .cse46)) (.cse49 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse46) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse47 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= .cse47 (select (select (store (store .cse48 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse49 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (forall ((v_prenex_126 (Array Int Int))) (not (= (select (select (store (store .cse48 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse47 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse47) (= .cse47 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse47 .cse49))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (or .cse13 (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse50 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse53 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse52 (select (select (store (store .cse53 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse50 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (v_prenex_318 Int)) (let ((.cse54 (+ v_prenex_318 4))) (let ((.cse51 (select v_prenex_317 .cse54))) (or (= .cse50 .cse51) (= .cse52 .cse51) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_320) .cse51 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store .cse53 |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_317) .cse51 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse51) (not (= (select v_prenex_320 .cse54) 0)))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse52))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse50)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse59 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse58 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse56 (select (select (store (store .cse58 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse59 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse57 (+ 4 v_subst_2))) (let ((.cse55 (select v_arrayElimArr_19 .cse57))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse55 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse56 .cse55) (not (= (select v_arrayElimArr_20 .cse57) 0)) (not (= (select (select (store (store .cse58 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse55 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse55))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse56))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse59)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))))) (or (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_prenex_318 Int) (|v_ULTIMATE.start_main_~t~0#1.base_41| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse64 (+ v_prenex_318 4)) (.cse63 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse60 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse62 (select (select (store (store .cse63 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse60 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (.cse61 (select v_prenex_317 .cse64))) (or (= .cse60 .cse61) (= .cse62 .cse61) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_320) .cse61 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse62) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store .cse63 |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_317) .cse61 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse61) (not (= (select v_prenex_320 .cse64) 0)))))) .cse13) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_3 Int) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_2 Int) (|v_ULTIMATE.start_main_~t~0#1.base_41| Int) (v_ArrVal_981 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse68 (+ 4 v_subst_2)) (.cse69 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse67 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse66 (select (select (store (store .cse69 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse67 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (.cse65 (select v_arrayElimArr_19 .cse68))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse65 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse66) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse67) (= .cse67 .cse65) (= .cse66 .cse67) (not (= (select v_arrayElimArr_20 .cse68) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (not (= (select (select (store (store .cse69 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse65 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse65))))) .cse13) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (|v_ULTIMATE.start_main_~t~0#1.base_41| Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse73 (+ 4 v_subst_2)) (.cse74 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse72 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse71 (select (select (store (store .cse74 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse72 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (.cse70 (select v_arrayElimArr_19 .cse73))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse70 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse71 .cse70) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse72) (= .cse71 .cse72) (not (= (select v_arrayElimArr_20 .cse73) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (not (= (select (select (store (store .cse74 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse70 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse70))))) .cse13) (or (and .cse75 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse80 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse79 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse76 (select (select (store (store .cse79 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse80 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse76) (forall ((v_prenex_466 Int) (v_prenex_464 (Array Int Int)) (v_prenex_465 (Array Int Int)) (v_prenex_467 (Array Int Int)) (v_prenex_468 (Array Int Int)) (v_prenex_469 (Array Int Int))) (let ((.cse78 (+ v_prenex_466 4))) (let ((.cse77 (select v_prenex_465 .cse78))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_467) |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_468) .cse77 v_prenex_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_prenex_468 .cse78) 0)) (not (= (select (select (store (store .cse79 |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_465) .cse77 v_prenex_464) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse77 |c_ULTIMATE.start_main_~p~0#1.base|))))) (= .cse76 .cse80))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse80)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0))))) .cse13) (or (and .cse81 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse82 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse82) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse83 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse83 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse82 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (forall ((v_prenex_490 (Array Int Int)) (v_prenex_491 (Array Int Int)) (v_prenex_493 (Array Int Int)) (v_prenex_494 (Array Int Int)) (v_prenex_495 (Array Int Int)) (v_prenex_492 Int)) (let ((.cse85 (+ v_prenex_492 4))) (let ((.cse84 (select v_prenex_491 .cse85))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_493) |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_494) .cse84 v_prenex_495) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (not (= (select v_prenex_494 .cse85) 0)) (not (= (select (select (store (store .cse83 |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_491) .cse84 v_prenex_490) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse84 |c_ULTIMATE.start_main_~p~0#1.base|))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0))))) .cse13) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse87 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse90 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse86 (select (select (store (store .cse90 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse87 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse86) (= .cse86 .cse87) (forall ((v_arrayElimArr_23 (Array Int Int)) (v_subst_1 Int)) (let ((.cse88 (+ 4 v_subst_1))) (or (not (= (select v_arrayElimArr_23 .cse88) 0)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse89 (select v_arrayElimArr_22 .cse88))) (or (= .cse89 .cse86) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse89) (= .cse89 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store .cse90 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse89 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse89 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|))))))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse87)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse91 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse91) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse95 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse94 (select (select (store (store .cse95 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse91 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse92 (+ 4 v_subst_1))) (let ((.cse93 (select v_arrayElimArr_22 .cse92))) (or (not (= (select v_arrayElimArr_23 .cse92) 0)) (= .cse93 .cse94) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse93) (= .cse93 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store .cse95 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse93 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse93 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse94) (= .cse94 .cse91)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (or .cse13 (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (|v_ULTIMATE.start_main_~t~0#1.base_41| Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse98 (+ 4 v_subst_2))) (let ((.cse97 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse96 (select v_arrayElimArr_19 .cse98))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse96 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse97 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) (select v_arrayElimArr_21 (+ 4 v_subst_3)) v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (not (= (select v_arrayElimArr_20 .cse98) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (not (= (select (select (store (store .cse97 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse96 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse96)))))) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse103 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse102 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse99 (select (select (store (store .cse102 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse103 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse99) (forall ((v_prenex_490 (Array Int Int)) (v_prenex_491 (Array Int Int)) (v_prenex_493 (Array Int Int)) (v_prenex_494 (Array Int Int)) (v_prenex_495 (Array Int Int)) (v_prenex_492 Int)) (let ((.cse101 (+ v_prenex_492 4))) (let ((.cse100 (select v_prenex_491 .cse101))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_493) |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_494) .cse100 v_prenex_495) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (not (= (select v_prenex_494 .cse101) 0)) (not (= (select (select (store (store .cse102 |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_491) .cse100 v_prenex_490) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse100 |c_ULTIMATE.start_main_~p~0#1.base|))))) (= .cse99 .cse103))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse103)))))) .cse75) .cse13) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse104 (+ 4 v_subst_1))) (let ((.cse107 (select v_arrayElimArr_21 (+ 4 v_subst_3))) (.cse106 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse105 (select v_arrayElimArr_22 .cse104))) (or (not (= (select v_arrayElimArr_23 .cse104) 0)) (= .cse105 (select (select (store (store .cse106 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse107 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse105) (= .cse105 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse105 .cse107) (not (= (select (select (store (store .cse106 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse105 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse105 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse112 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse111 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse108 (select (select (store (store .cse111 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse112 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse108) (forall ((v_arrayElimArr_23 (Array Int Int)) (v_subst_1 Int)) (let ((.cse109 (+ 4 v_subst_1))) (or (not (= (select v_arrayElimArr_23 .cse109) 0)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse110 (select v_arrayElimArr_22 .cse109))) (or (= .cse110 .cse108) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse110) (= .cse110 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store .cse111 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse110 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse110 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|))))))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse112)))))) (or .cse13 (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse114 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse117 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse113 (select (select (store (store .cse117 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse114 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse113) (= .cse113 .cse114) (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse116 (+ 4 v_subst_2))) (let ((.cse115 (select v_arrayElimArr_19 .cse116))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse115 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_20 .cse116) 0)) (not (= (select (select (store (store .cse117 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse115 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse115))))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse114)))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse118 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse118) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse122 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse121 (select (select (store (store .cse122 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse118 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (forall ((v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse119 (+ 4 v_subst_2))) (or (not (= (select v_arrayElimArr_20 .cse119) 0)) (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse120 (select v_arrayElimArr_19 .cse119))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse120 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse121 .cse120) (not (= (select (select (store (store .cse122 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse120 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse120))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse121) (= .cse121 .cse118)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))))) (or .cse13 (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_3 Int) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_2 Int) (|v_ULTIMATE.start_main_~t~0#1.base_41| Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse126 (+ 4 v_subst_2)) (.cse127 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse125 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse124 (select (select (store (store .cse127 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse125 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (.cse123 (select v_arrayElimArr_19 .cse126))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse123 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse124) (= .cse125 .cse123) (= .cse124 .cse125) (not (= (select v_arrayElimArr_20 .cse126) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (not (= (select (select (store (store .cse127 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse123 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse123)))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse129 (select v_arrayElimArr_21 (+ 4 v_subst_3))) (.cse128 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse128 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse129 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse130 (+ 4 v_subst_1))) (let ((.cse131 (select v_arrayElimArr_22 .cse130))) (or (not (= (select v_arrayElimArr_23 .cse130) 0)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse131) (= .cse131 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse131 .cse129) (not (= (select (select (store (store .cse128 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse131 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse131 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (or (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_prenex_318 Int) (|v_ULTIMATE.start_main_~t~0#1.base_41| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse135 (+ v_prenex_318 4))) (let ((.cse132 (select v_arrayElimArr_21 (+ 4 v_subst_3))) (.cse134 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse133 (select v_prenex_317 .cse135))) (or (= .cse132 .cse133) (= (select (select (store (store .cse134 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse132 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse133) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_320) .cse133 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse132) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store .cse134 |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_317) .cse133 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse133) (not (= (select v_prenex_320 .cse135) 0)))))) .cse13) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse137 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse136 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse137 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse136) (= .cse136 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse137) (= .cse137 |c_ULTIMATE.start_main_~a~0#1.base|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse141 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse142 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse138 (select (select (store (store .cse141 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse142 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse138) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_subst_1 Int)) (let ((.cse139 (+ 4 v_subst_1))) (let ((.cse140 (select v_arrayElimArr_22 .cse139))) (or (forall ((v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse139) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse140 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= .cse140 .cse138) (forall ((v_prenex_126 (Array Int Int))) (not (= (select (select (store (store .cse141 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse140 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse140) (= .cse140 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse140 .cse142))))))))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse146 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse145 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse144 (select (select (store (store .cse146 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse145 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (forall ((v_arrayElimArr_23 (Array Int Int)) (v_subst_1 Int)) (let ((.cse147 (+ 4 v_subst_1))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse143 (select v_arrayElimArr_22 .cse147))) (or (= .cse143 .cse144) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse143) (= .cse143 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse143 .cse145) (not (= (select (select (store (store .cse146 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse143 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse143 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select v_arrayElimArr_23 .cse147) 0))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse144))))))) (or (and .cse81 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse149 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse148 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse148 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse149 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (forall ((v_prenex_466 Int) (v_prenex_464 (Array Int Int)) (v_prenex_465 (Array Int Int)) (v_prenex_467 (Array Int Int)) (v_prenex_468 (Array Int Int)) (v_prenex_469 (Array Int Int))) (let ((.cse151 (+ v_prenex_466 4))) (let ((.cse150 (select v_prenex_465 .cse151))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_467) |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_468) .cse150 v_prenex_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_prenex_468 .cse151) 0)) (not (= (select (select (store (store .cse148 |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_465) .cse150 v_prenex_464) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse150 |c_ULTIMATE.start_main_~p~0#1.base|)))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse149)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0))))) .cse13) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse152 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse152) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse155 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse154 (select (select (store (store .cse155 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse152 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (v_prenex_318 Int)) (let ((.cse156 (+ v_prenex_318 4))) (let ((.cse153 (select v_prenex_317 .cse156))) (or (= .cse152 .cse153) (= .cse154 .cse153) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_320) .cse153 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store .cse155 |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_317) .cse153 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse153) (not (= (select v_prenex_320 .cse156) 0)))))) (= .cse154 .cse152)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse157 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse157) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse161 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse159 (select (select (store (store .cse161 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse157 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse160 (+ 4 v_subst_2))) (let ((.cse158 (select v_arrayElimArr_19 .cse160))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse158 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse159 .cse158) (not (= (select v_arrayElimArr_20 .cse160) 0)) (not (= (select (select (store (store .cse161 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse158 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse158))))) (= .cse159 .cse157))))))))))) .cse13) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse165 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse166 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse164 (select (select (store (store .cse165 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse166 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse162 (+ 4 v_subst_1))) (let ((.cse163 (select v_arrayElimArr_22 .cse162))) (or (not (= (select v_arrayElimArr_23 .cse162) 0)) (= .cse163 .cse164) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse163) (= .cse163 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store .cse165 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse163 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse163 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse166) (= .cse164 .cse166))))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse167 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse167) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse171 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse170 (select (select (store (store .cse171 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse167 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse168 (+ 4 v_subst_1))) (let ((.cse169 (select v_arrayElimArr_22 .cse168))) (or (not (= (select v_arrayElimArr_23 .cse168) 0)) (= .cse169 .cse170) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse169) (= .cse169 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store .cse171 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse169 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse169 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse170)))))))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse172 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse172) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse175 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse173 (+ 4 v_subst_1))) (let ((.cse174 (select v_arrayElimArr_22 .cse173))) (or (not (= (select v_arrayElimArr_23 .cse173) 0)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse174) (= .cse174 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store .cse175 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_22) .cse174 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_23) .cse174 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse175 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse172 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)))))))))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (|v_ULTIMATE.start_main_~t~0#1.base_41| Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse178 (+ 4 v_subst_2))) (let ((.cse177 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse176 (select v_arrayElimArr_19 .cse178))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse176 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|) (= (select (select (store (store .cse177 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) (select v_arrayElimArr_21 (+ 4 v_subst_3)) v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse176) (not (= (select v_arrayElimArr_20 .cse178) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (not (= (select (select (store (store .cse177 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse176 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse176))))) .cse13) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse179 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse182 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse181 (select (select (store (store .cse182 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse179 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (v_prenex_318 Int)) (let ((.cse183 (+ v_prenex_318 4))) (let ((.cse180 (select v_prenex_317 .cse183))) (or (= .cse179 .cse180) (= .cse181 .cse180) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_320) .cse180 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store .cse182 |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_317) .cse180 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse180) (not (= (select v_prenex_320 .cse183) 0)))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse181) (= .cse181 .cse179))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse179)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse184 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse184) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse188 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|)))) (let ((.cse186 (select (select (store (store .cse188 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse184 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse187 (+ 4 v_subst_2))) (let ((.cse185 (select v_arrayElimArr_19 .cse187))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_20) .cse185 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse186 .cse185) (not (= (select v_arrayElimArr_20 .cse187) 0)) (not (= (select (select (store (store .cse188 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_19) .cse185 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse185))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse186) (= .cse186 .cse184)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0))))) .cse13) (or (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_prenex_318 Int) (|v_ULTIMATE.start_main_~t~0#1.base_41| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse192 (+ v_prenex_318 4))) (let ((.cse189 (select v_arrayElimArr_21 (+ 4 v_subst_3))) (.cse191 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_41|))) (.cse190 (select v_prenex_317 .cse192))) (or (= .cse189 .cse190) (= (select (select (store (store .cse191 |v_ULTIMATE.start_main_~t~0#1.base_41| v_arrayElimArr_21) .cse189 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse190) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_320) .cse190 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store .cse191 |v_ULTIMATE.start_main_~t~0#1.base_41| v_prenex_317) .cse190 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse190) (not (= (select v_prenex_320 .cse192) 0)))))) .cse13))) .cse5) (= (select |c_#valid| .cse1) 1)))) is different from true [2022-12-14 14:51:53,008 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse191 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (let ((.cse192 (= .cse191 |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse16 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (or (< |c_ULTIMATE.start_main_~a~0#1.offset| 0) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|))) (let ((.cse15 (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse187 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse187) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse188 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse188 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse187 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse190 (+ 4 v_subst_2))) (let ((.cse189 (select v_arrayElimArr_19 .cse190))) (or (not (= (select (select (store (store .cse188 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse189 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse187 .cse189) (not (= (select v_arrayElimArr_20 .cse190) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse189 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse189)))))))))))) (.cse55 (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse183 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse184 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse182 (select (select (store (store .cse184 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse183 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse182) (= .cse183 .cse182) (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse186 (+ 4 v_subst_2))) (let ((.cse185 (select v_arrayElimArr_19 .cse186))) (or (not (= (select (select (store (store .cse184 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse185 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse183 .cse185) (not (= (select v_arrayElimArr_20 .cse186) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse185 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse185))))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse183)))))) (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse0 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse0) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse0 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse3 (+ 4 v_subst_1))) (let ((.cse4 (select v_arrayElimArr_22 .cse3))) (or (not (= (select v_arrayElimArr_23 .cse3) 0)) (not (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse4 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse4 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse4) (= .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))))))))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse10 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse9 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse10 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_23 (Array Int Int)) (v_subst_1 Int)) (let ((.cse6 (+ 4 v_subst_1))) (or (not (= (select v_arrayElimArr_23 .cse6) 0)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse8 (select v_arrayElimArr_22 .cse6))) (or (not (= (select (select (store (store .cse7 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse8 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse8 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse8) (= .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse8 .cse9))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse9))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse10)))) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse14 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (or (forall ((v_prenex_490 (Array Int Int)) (v_prenex_491 (Array Int Int)) (v_prenex_493 (Array Int Int)) (v_prenex_494 (Array Int Int)) (v_prenex_495 (Array Int Int)) (v_prenex_492 Int)) (let ((.cse13 (+ v_prenex_492 4))) (let ((.cse12 (select v_prenex_491 .cse13))) (or (not (= (select (select (store (store .cse11 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_491) .cse12 v_prenex_490) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_493) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_494) .cse12 v_prenex_495) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_prenex_494 .cse13) 0)) (= .cse12 |c_ULTIMATE.start_main_~p~0#1.base|))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse11 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse14 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse14)))) .cse15) .cse16) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse19 (+ 4 v_subst_2))) (let ((.cse18 (select v_arrayElimArr_19 .cse19)) (.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (or (not (= (select (select (store (store .cse17 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse18 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select v_arrayElimArr_20 .cse19) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse18 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse18) (= .cse18 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) (select v_arrayElimArr_21 (+ 4 v_subst_3)) v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) .cse16) (or (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_prenex_318 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse23 (+ v_prenex_318 4))) (let ((.cse21 (select v_arrayElimArr_21 (+ 4 v_subst_3))) (.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse20 (select v_prenex_317 .cse23))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_320) .cse20 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse21 .cse20) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse21) (= (select (select (store (store .cse22 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse21 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse20) (not (= (select (select (store (store .cse22 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_317) .cse20 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse20) (not (= (select v_prenex_320 .cse23) 0)))))) .cse16) (or (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_prenex_318 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse27 (+ v_prenex_318 4))) (let ((.cse25 (select v_arrayElimArr_21 (+ 4 v_subst_3))) (.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse24 (select v_prenex_317 .cse27))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_320) .cse24 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse25 .cse24) (= (select (select (store (store .cse26 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse25 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse24) (not (= (select (select (store (store .cse26 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_317) .cse24 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse24) (not (= (select v_prenex_320 .cse27) 0)))))) .cse16) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse29 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse31 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse28 (+ 4 v_subst_1))) (let ((.cse30 (select v_arrayElimArr_22 .cse28))) (or (not (= (select v_arrayElimArr_23 .cse28) 0)) (not (= (select (select (store (store .cse29 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse30 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse30 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse30) (= .cse30 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse30 .cse31))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse29 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse31 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse35 (+ 4 v_subst_2))) (let ((.cse33 (select v_arrayElimArr_19 .cse35)) (.cse34 (select (select (store (store .cse32 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) (select v_arrayElimArr_21 (+ 4 v_subst_3)) v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select (select (store (store .cse32 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse33 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse34) (not (= (select v_arrayElimArr_20 .cse35) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse33 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse33) (= .cse33 .cse34))))) .cse16) (or .cse16 (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse40 (+ 4 v_subst_2)) (.cse36 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse39 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse38 (select (select (store (store .cse36 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse39 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse37 (select v_arrayElimArr_19 .cse40))) (or (not (= (select (select (store (store .cse36 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse37 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse38) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse39) (= .cse39 .cse37) (= .cse39 .cse38) (not (= (select v_arrayElimArr_20 .cse40) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse37 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse37)))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse42 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse45 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse44 (select (select (store (store .cse42 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse45 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_23 (Array Int Int)) (v_subst_1 Int)) (let ((.cse41 (+ 4 v_subst_1))) (or (not (= (select v_arrayElimArr_23 .cse41) 0)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse43 (select v_arrayElimArr_22 .cse41))) (or (not (= (select (select (store (store .cse42 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse43 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse43 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse43) (= .cse43 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse43 .cse44) (= .cse43 .cse45))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse44))))) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse46 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse46) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse49 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (or (forall ((v_prenex_466 Int) (v_prenex_464 (Array Int Int)) (v_prenex_465 (Array Int Int)) (v_prenex_467 (Array Int Int)) (v_prenex_468 (Array Int Int)) (v_prenex_469 (Array Int Int))) (let ((.cse47 (+ v_prenex_466 4))) (let ((.cse48 (select v_prenex_465 .cse47))) (or (not (= (select v_prenex_468 .cse47) 0)) (= .cse48 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_467) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_468) .cse48 v_prenex_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select (select (store (store .cse49 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_465) .cse48 v_prenex_464) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse49 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse46 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) .cse15) .cse16) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse54 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse50 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse53 (select (select (store (store .cse50 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse54 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_490 (Array Int Int)) (v_prenex_491 (Array Int Int)) (v_prenex_493 (Array Int Int)) (v_prenex_494 (Array Int Int)) (v_prenex_495 (Array Int Int)) (v_prenex_492 Int)) (let ((.cse52 (+ v_prenex_492 4))) (let ((.cse51 (select v_prenex_491 .cse52))) (or (not (= (select (select (store (store .cse50 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_491) .cse51 v_prenex_490) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_493) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_494) .cse51 v_prenex_495) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_prenex_494 .cse52) 0)) (= .cse51 |c_ULTIMATE.start_main_~p~0#1.base|))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse53) (= .cse54 .cse53))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse54)))) .cse55) .cse16) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse60 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse57 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse59 (select (select (store (store .cse57 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse60 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_23 (Array Int Int)) (v_subst_1 Int)) (let ((.cse56 (+ 4 v_subst_1))) (or (not (= (select v_arrayElimArr_23 .cse56) 0)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse58 (select v_arrayElimArr_22 .cse56))) (or (not (= (select (select (store (store .cse57 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse58 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse58 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse58) (= .cse58 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse58 .cse59))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse59) (= .cse60 .cse59))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse60)))) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int)) (v_subst_1 Int)) (let ((.cse63 (+ 4 v_subst_1))) (let ((.cse61 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse62 (select v_arrayElimArr_22 .cse63)) (.cse64 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((v_prenex_126 (Array Int Int))) (not (= (select (select (store (store .cse61 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse62 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse63) 0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse62 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse62) (= .cse62 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse62 (select (select (store (store .cse61 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse64 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse62 .cse64))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse65 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse65) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse68 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse66 (select (select (store (store .cse68 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse65 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse66) (= .cse65 .cse66) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse67 (+ 4 v_subst_1))) (let ((.cse69 (select v_arrayElimArr_22 .cse67))) (or (not (= (select v_arrayElimArr_23 .cse67) 0)) (not (= (select (select (store (store .cse68 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse69 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse69 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse69) (= .cse69 |c_ULTIMATE.start_main_~a~0#1.base|)))))))))))) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse70 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse70) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse71 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse74 (select (select (store (store .cse71 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse70 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse73 (+ 4 v_subst_2))) (let ((.cse72 (select v_arrayElimArr_19 .cse73))) (or (not (= (select (select (store (store .cse71 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse72 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select v_arrayElimArr_20 .cse73) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse72 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse72) (= .cse72 .cse74))))) (= .cse70 .cse74)))))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse75 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse78 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse76 (select (select (store (store .cse78 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse75 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse75 .cse76) (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (v_prenex_318 Int)) (let ((.cse79 (+ v_prenex_318 4))) (let ((.cse77 (select v_prenex_317 .cse79))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_320) .cse77 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse75 .cse77) (= .cse76 .cse77) (not (= (select (select (store (store .cse78 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_317) .cse77 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse77) (not (= (select v_prenex_320 .cse79) 0)))))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse75))))) .cse16) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse84 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse80 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse83 (select (select (store (store .cse80 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse84 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse82 (+ 4 v_subst_2))) (let ((.cse81 (select v_arrayElimArr_19 .cse82))) (or (not (= (select (select (store (store .cse80 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse81 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select v_arrayElimArr_20 .cse82) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse81 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse81) (= .cse81 .cse83))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse83) (= .cse84 .cse83))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse84)))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse85 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse85) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse88 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse86 (select (select (store (store .cse88 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse85 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse86) (= .cse85 .cse86) (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (v_prenex_318 Int)) (let ((.cse89 (+ v_prenex_318 4))) (let ((.cse87 (select v_prenex_317 .cse89))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_320) .cse87 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse85 .cse87) (= .cse86 .cse87) (not (= (select (select (store (store .cse88 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_317) .cse87 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse87) (not (= (select v_prenex_320 .cse89) 0)))))))))))))) .cse16) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_981 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse92 (+ 4 v_subst_2))) (let ((.cse90 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse91 (select v_arrayElimArr_19 .cse92))) (or (not (= (select (select (store (store .cse90 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse91 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse90 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) (select v_arrayElimArr_21 (+ 4 v_subst_3)) v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_arrayElimArr_20 .cse92) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse91 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse91))))) .cse16) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse97 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse95 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse96 (select (select (store (store .cse95 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse97 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_466 Int) (v_prenex_464 (Array Int Int)) (v_prenex_465 (Array Int Int)) (v_prenex_467 (Array Int Int)) (v_prenex_468 (Array Int Int)) (v_prenex_469 (Array Int Int))) (let ((.cse93 (+ v_prenex_466 4))) (let ((.cse94 (select v_prenex_465 .cse93))) (or (not (= (select v_prenex_468 .cse93) 0)) (= .cse94 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_467) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_468) .cse94 v_prenex_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select (select (store (store .cse95 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_465) .cse94 v_prenex_464) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse96) (= .cse97 .cse96))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse97)))) .cse55) .cse16) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse99 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse102 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse98 (select (select (store (store .cse99 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse102 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse98) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_subst_1 Int)) (let ((.cse101 (+ 4 v_subst_1))) (let ((.cse100 (select v_arrayElimArr_22 .cse101))) (or (forall ((v_prenex_126 (Array Int Int))) (not (= (select (select (store (store .cse99 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse100 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse101) 0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse100 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse100) (= .cse100 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse100 .cse98) (= .cse100 .cse102))))))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse105 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse107 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse103 (select (select (store (store .cse105 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse107 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse103) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse104 (+ 4 v_subst_1))) (let ((.cse106 (select v_arrayElimArr_22 .cse104))) (or (not (= (select v_arrayElimArr_23 .cse104) 0)) (not (= (select (select (store (store .cse105 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse106 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse106 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse106) (= .cse106 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse106 .cse103) (= .cse106 .cse107))))))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse112 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse109 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse111 (select (select (store (store .cse109 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse112 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_23 (Array Int Int)) (v_subst_1 Int)) (let ((.cse108 (+ 4 v_subst_1))) (or (not (= (select v_arrayElimArr_23 .cse108) 0)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse110 (select v_arrayElimArr_22 .cse108))) (or (not (= (select (select (store (store .cse109 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse110 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse110 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse110) (= .cse110 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse110 .cse111))))))) (= .cse112 .cse111))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse112)))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int)) (v_subst_1 Int)) (let ((.cse113 (+ 4 v_subst_1))) (or (not (= (select v_arrayElimArr_23 .cse113) 0)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse114 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse115 (select v_arrayElimArr_22 .cse113)) (.cse116 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (not (= (select (select (store (store .cse114 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse115 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse115 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse115) (= .cse115 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse115 (select (select (store (store .cse114 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse116 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse115 .cse116))))))) (or .cse16 (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse117 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse119 (select v_arrayElimArr_21 (+ 4 v_subst_3))) (.cse121 (+ 4 v_subst_2))) (let ((.cse118 (select v_arrayElimArr_19 .cse121)) (.cse120 (select (select (store (store .cse117 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse119 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select (select (store (store .cse117 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse118 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse119) (= .cse119 .cse120) (not (= (select v_arrayElimArr_20 .cse121) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse118 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse118) (= .cse118 .cse120)))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse123 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse122 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse123 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse122) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse123) (= .cse123 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse122))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse124 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse124) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse126 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse128 (select (select (store (store .cse126 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse124 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse125 (+ 4 v_subst_1))) (let ((.cse127 (select v_arrayElimArr_22 .cse125))) (or (not (= (select v_arrayElimArr_23 .cse125) 0)) (not (= (select (select (store (store .cse126 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse127 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse127 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse127) (= .cse127 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse127 .cse128))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse128)))))))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse133 (+ 4 v_subst_2)) (.cse129 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse132 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse131 (select (select (store (store .cse129 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse132 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse130 (select v_arrayElimArr_19 .cse133))) (or (not (= (select (select (store (store .cse129 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse130 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse131) (= .cse132 .cse130) (= .cse132 .cse131) (not (= (select v_arrayElimArr_20 .cse133) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse130 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse130))))) .cse16) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse137 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse134 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse136 (+ 4 v_subst_2))) (let ((.cse135 (select v_arrayElimArr_19 .cse136))) (or (not (= (select (select (store (store .cse134 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse135 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select v_arrayElimArr_20 .cse136) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse135 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse135))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse134 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse137 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse137)))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse142 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse138 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse140 (select (select (store (store .cse138 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse142 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse141 (+ 4 v_subst_2))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse139 (select v_arrayElimArr_19 .cse141))) (or (not (= (select (select (store (store .cse138 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse139 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse139 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse139) (= .cse139 .cse140)))) (not (= (select v_arrayElimArr_20 .cse141) 0))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse140))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse142))))) .cse16) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse144 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse147 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse146 (select (select (store (store .cse144 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse147 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse143 (+ 4 v_subst_1))) (let ((.cse145 (select v_arrayElimArr_22 .cse143))) (or (not (= (select v_arrayElimArr_23 .cse143) 0)) (not (= (select (select (store (store .cse144 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse145 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse145 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse145) (= .cse145 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse145 .cse146))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse147) (= .cse147 .cse146))))) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse148 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse148) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse149 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse152 (select (select (store (store .cse149 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse148 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse151 (+ 4 v_subst_2))) (let ((.cse150 (select v_arrayElimArr_19 .cse151))) (or (not (= (select (select (store (store .cse149 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse150 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select v_arrayElimArr_20 .cse151) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse150 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse150) (= .cse150 .cse152))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse152)))))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse153 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse153) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse156 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse154 (select (select (store (store .cse156 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse153 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse154) (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (v_prenex_318 Int)) (let ((.cse157 (+ v_prenex_318 4))) (let ((.cse155 (select v_prenex_317 .cse157))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_320) .cse155 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse153 .cse155) (= .cse154 .cse155) (not (= (select (select (store (store .cse156 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_317) .cse155 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse155) (not (= (select v_prenex_320 .cse157) 0)))))))))))))) .cse16) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse162 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse159 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse161 (select (select (store (store .cse159 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse162 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse158 (+ 4 v_subst_1))) (let ((.cse160 (select v_arrayElimArr_22 .cse158))) (or (not (= (select v_arrayElimArr_23 .cse158) 0)) (not (= (select (select (store (store .cse159 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse160 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse160 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse160) (= .cse160 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse160 .cse161))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse161) (= .cse162 .cse161))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse162)))) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse163 (+ 4 v_subst_1))) (let ((.cse164 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse165 (select v_arrayElimArr_22 .cse163)) (.cse166 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (not (= (select v_arrayElimArr_23 .cse163) 0)) (not (= (select (select (store (store .cse164 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse165 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse165 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse165) (= .cse165 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse165 (select (select (store (store .cse164 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse166 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse165 .cse166))))) (or (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_prenex_318 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse171 (+ v_prenex_318 4)) (.cse170 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse168 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse169 (select (select (store (store .cse170 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse168 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse167 (select v_prenex_317 .cse171))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_320) .cse167 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse168 .cse167) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse169) (= .cse169 .cse167) (not (= (select (select (store (store .cse170 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_317) .cse167 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse167) (not (= (select v_prenex_320 .cse171) 0)))))) .cse16) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse176 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse172 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse174 (select (select (store (store .cse172 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse176 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse175 (+ 4 v_subst_2))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse173 (select v_arrayElimArr_19 .cse175))) (or (not (= (select (select (store (store .cse172 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse173 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse173 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse173) (= .cse173 .cse174)))) (not (= (select v_arrayElimArr_20 .cse175) 0))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse174) (= .cse176 .cse174))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse176)))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse181 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse177 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse180 (select (select (store (store .cse177 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse181 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse179 (+ 4 v_subst_2))) (let ((.cse178 (select v_arrayElimArr_19 .cse179))) (or (not (= (select (select (store (store .cse177 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse178 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select v_arrayElimArr_20 .cse179) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse178 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse178))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse180) (= .cse181 .cse180))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse181))))) .cse16))))) (not (= .cse191 |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) .cse192 (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse191 |c_ULTIMATE.start_main_~t~0#1.base|)) (or (exists ((|v_ULTIMATE.start_main_~p~0#1.offset_232| Int)) (let ((.cse193 (select (select |c_#memory_$Pointer$.base| .cse191) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_232|)))) (and (= |c_ULTIMATE.start_main_~p~0#1.base| .cse193) (not (= |c_ULTIMATE.start_main_~a~0#1.base| .cse193))))) .cse192) .cse16 (= (select |c_#valid| .cse191) 1)))) is different from true [2022-12-14 14:52:13,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:52:24,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:52:32,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:53:35,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:53:38,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:53:48,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]